%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SWV009-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n001.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Jun 24 16:45:28 EDT 2024 % Result : Unsatisfiable 0.54s 0.65s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.13 % Problem : SWV009-1 : TPTP v8.2.0. Released v1.0.0. % 0.09/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.35 % Computer : n001.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Thu Jun 20 20:14:38 EDT 2024 % 0.13/0.35 % CPUTime : % 0.21/0.58 start to proof:theBenchmark % 0.54/0.64 %------------------------------------------- % 0.54/0.64 % File :CSE---1.7 % 0.54/0.64 % Problem :theBenchmark % 0.54/0.64 % Transform :cnf % 0.54/0.64 % Format :tptp:raw % 0.54/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.64 % 0.54/0.64 % Result :Theorem 0.020000s % 0.54/0.64 % Output :CNFRefutation 0.020000s % 0.54/0.64 %------------------------------------------- % 0.54/0.64 %-------------------------------------------------------------------------- % 0.54/0.65 % File : SWV009-1 : TPTP v8.2.0. Released v1.0.0. % 0.54/0.65 % Domain : Software Verification % 0.54/0.65 % Problem : A condition from Hoare's FIND program % 0.54/0.65 % Version : Especial. % 0.54/0.65 % English : % 0.54/0.65 % 0.54/0.65 % Refs : [Ble77] Bledsoe (1977), Non-resolution Theorem Proving % 0.54/0.65 % : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format % 0.54/0.65 % Source : [Pla82] % 0.54/0.65 % Names : Hoares FIND [Ble77] % 0.54/0.65 % : Problem 5.5 [Pla82] % 0.54/0.65 % 0.54/0.65 % Status : Unsatisfiable % 0.54/0.65 % Rating : 0.00 v2.0.0 % 0.54/0.65 % Syntax : Number of clauses : 9 ( 5 unt; 1 nHn; 8 RR) % 0.54/0.65 % Number of literals : 20 ( 0 equ; 11 neg) % 0.54/0.65 % Maximal clause size : 5 ( 2 avg) % 0.54/0.65 % Maximal term depth : 2 ( 1 avg) % 0.54/0.65 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.54/0.65 % Number of functors : 7 ( 7 usr; 6 con; 0-1 aty) % 0.54/0.65 % Number of variables : 8 ( 0 sgn) % 0.54/0.65 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.54/0.65 % 0.54/0.65 % Comments : % 0.54/0.65 %-------------------------------------------------------------------------- % 0.54/0.65 cnf(clause_1,negated_conjecture, % 0.54/0.65 ( less_or_equal(X,Y) % 0.54/0.65 | less(Y,X) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_2,negated_conjecture, % 0.54/0.65 less(j,i) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_3,negated_conjecture, % 0.54/0.65 less_or_equal(m,p) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_4,negated_conjecture, % 0.54/0.65 less_or_equal(p,q) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_5,negated_conjecture, % 0.54/0.65 less_or_equal(q,n) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_6,negated_conjecture, % 0.54/0.65 ( ~ less_or_equal(m,X) % 0.54/0.65 | ~ less(X,i) % 0.54/0.65 | ~ less(j,Y) % 0.54/0.65 | ~ less_or_equal(Y,n) % 0.54/0.65 | less_or_equal(a(X),a(Y)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_7,negated_conjecture, % 0.54/0.65 ( ~ less_or_equal(m,X) % 0.54/0.65 | ~ less_or_equal(X,Y) % 0.54/0.65 | ~ less_or_equal(Y,j) % 0.54/0.65 | less_or_equal(a(X),a(Y)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_8,negated_conjecture, % 0.54/0.65 ( ~ less_or_equal(i,X) % 0.54/0.65 | ~ less_or_equal(X,Y) % 0.54/0.65 | ~ less_or_equal(Y,n) % 0.54/0.65 | less_or_equal(a(X),a(Y)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_9,negated_conjecture, % 0.54/0.65 ~ less_or_equal(a(p),a(q)) ). % 0.54/0.65 % 0.54/0.65 %-------------------------------------------------------------------------- % 0.54/0.65 %------------------------------------------- % 0.54/0.65 % Proof found % 0.54/0.65 % SZS status Theorem for theBenchmark % 0.54/0.65 % SZS output start Proof % 0.54/0.65 %ClaNum:9(EqnAxiom:0) % 0.54/0.65 %VarNum:22(SingletonVarNum:8) % 0.54/0.65 %MaxLitNum:5 % 0.54/0.65 %MaxfuncDepth:1 % 0.54/0.65 %SharedTerms:13 % 0.54/0.65 %goalClause: 1 2 3 4 5 6 7 8 9 % 0.54/0.65 %singleGoalClaCount:5 % 0.54/0.65 [1]P1(a1,a5) % 0.54/0.65 [2]P1(a5,a7) % 0.54/0.65 [3]P1(a7,a6) % 0.54/0.65 [4]P2(a2,a3) % 0.54/0.65 [5]~P1(f4(a5),f4(a7)) % 0.54/0.65 [6]P2(x62,x61)+P1(x61,x62) % 0.54/0.65 [7]~P1(x71,x72)+~P1(x72,a2)+~P1(a1,x71)+P1(f4(x71),f4(x72)) % 0.54/0.65 [8]~P1(x81,x82)+~P1(x82,a6)+~P1(a3,x81)+P1(f4(x81),f4(x82)) % 0.54/0.65 [9]~P1(x92,a6)+~P2(x91,a3)+~P1(a1,x91)+~P2(a2,x92)+P1(f4(x91),f4(x92)) % 0.54/0.65 %EqnAxiom % 0.54/0.65 % 0.54/0.65 %------------------------------------------- % 0.54/0.65 cnf(12,plain, % 0.54/0.65 (~P1(a3,a5)), % 0.54/0.65 inference(scs_inference,[],[2,3,5,6,8])). % 0.54/0.65 cnf(15,plain, % 0.54/0.65 (P2(a5,a3)), % 0.54/0.65 inference(scs_inference,[],[12,6])). % 0.54/0.65 cnf(108,plain, % 0.54/0.65 (P2(a2,a7)), % 0.54/0.65 inference(scs_inference,[],[1,5,2,6,7])). % 0.54/0.65 cnf(111,plain, % 0.54/0.65 ($false), % 0.54/0.65 inference(scs_inference,[],[1,15,108,3,5,6,9]), % 0.54/0.65 ['proof']). % 0.54/0.65 % SZS output end Proof % 0.54/0.65 % Total time :0.020000s %------------------------------------------------------------------------------