%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN554-1 : TPTP v8.2.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n024.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 19:05:57 EDT 2024 % Result : Unsatisfiable 0.54s 0.59s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN554-1 : TPTP v8.2.0. Released v2.5.0. % 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Jun 23 20:46:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 0.53/0.58 %------------------------------------------- % 0.53/0.58 % File :CSE---1.7 % 0.53/0.58 % Problem :theBenchmark % 0.53/0.58 % Transform :cnf % 0.53/0.58 % Format :tptp:raw % 0.53/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.58 % 0.53/0.58 % Result :Theorem 0.000000s % 0.53/0.58 % Output :CNFRefutation 0.000000s % 0.53/0.58 %------------------------------------------- % 0.54/0.59 %-------------------------------------------------------------------------- % 0.54/0.59 % File : SYN554-1 : TPTP v8.2.0. Released v2.5.0. % 0.54/0.59 % Domain : Syntactic % 0.54/0.59 % Problem : Harrison problem 1667 % 0.54/0.59 % Version : Especial. % 0.54/0.59 % English : % 0.54/0.59 % 0.54/0.59 % Refs : [Har01] Email to G. Sutcliffe % 0.54/0.59 % Source : [Har01] % 0.54/0.59 % Names : % 0.54/0.59 % 0.54/0.59 % Status : Unsatisfiable % 0.54/0.59 % Rating : 0.00 v2.5.0 % 0.54/0.59 % Syntax : Number of clauses : 9 ( 4 unt; 1 nHn; 7 RR) % 0.54/0.59 % Number of literals : 19 ( 0 equ; 10 neg) % 0.54/0.59 % Maximal clause size : 4 ( 2 avg) % 0.54/0.59 % Maximal term depth : 2 ( 1 avg) % 0.54/0.59 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.54/0.59 % Number of functors : 4 ( 4 usr; 3 con; 0-2 aty) % 0.54/0.59 % Number of variables : 17 ( 0 sgn) % 0.54/0.59 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.54/0.59 % 0.54/0.59 % Comments : % 0.54/0.59 %-------------------------------------------------------------------------- % 0.54/0.59 cnf(p2_1,negated_conjecture, % 0.54/0.59 p2(X2,X2) ). % 0.54/0.59 % 0.54/0.59 cnf(not_p4_2,negated_conjecture, % 0.54/0.59 ~ p4(X15,X15) ). % 0.54/0.59 % 0.54/0.59 cnf(not_p2_3,negated_conjecture, % 0.54/0.59 ~ p2(c6,c7) ). % 0.54/0.59 % 0.54/0.59 cnf(p2_4,negated_conjecture, % 0.54/0.59 p2(f3(c5,c6),f3(c5,c7)) ). % 0.54/0.59 % 0.54/0.59 cnf(p2_5,negated_conjecture, % 0.54/0.59 ( p2(X0,X1) % 0.54/0.59 | p4(X0,X1) % 0.54/0.59 | p4(X1,X0) ) ). % 0.54/0.59 % 0.54/0.59 cnf(p2_6,negated_conjecture, % 0.54/0.59 ( p2(X3,X4) % 0.54/0.59 | ~ p2(X2,X4) % 0.54/0.59 | ~ p2(X2,X3) ) ). % 0.54/0.59 % 0.54/0.59 cnf(p4_7,negated_conjecture, % 0.54/0.59 ( p4(f3(c5,X13),f3(c5,X14)) % 0.54/0.59 | ~ p4(X13,X14) ) ). % 0.54/0.59 % 0.54/0.59 cnf(p4_8,negated_conjecture, % 0.54/0.59 ( p4(X9,X10) % 0.54/0.59 | ~ p2(X12,X10) % 0.54/0.59 | ~ p4(X11,X12) % 0.54/0.59 | ~ p2(X11,X9) ) ). % 0.54/0.59 % 0.54/0.59 cnf(p2_9,negated_conjecture, % 0.54/0.59 ( p2(f3(X5,X6),f3(X7,X8)) % 0.54/0.59 | ~ p2(X5,X7) % 0.54/0.59 | ~ p2(X6,X8) ) ). % 0.54/0.59 % 0.54/0.59 %-------------------------------------------------------------------------- % 0.54/0.59 %------------------------------------------- % 0.54/0.59 % Proof found % 0.54/0.59 % SZS status Theorem for theBenchmark % 0.54/0.59 % SZS output start Proof % 0.54/0.59 %ClaNum:9(EqnAxiom:0) % 0.54/0.59 %VarNum:36(SingletonVarNum:17) % 0.54/0.59 %MaxLitNum:4 % 0.54/0.59 %MaxfuncDepth:1 % 0.54/0.59 %SharedTerms:7 % 0.54/0.59 %goalClause: 1 2 3 4 5 6 7 8 9 % 0.54/0.59 %singleGoalClaCount:4 % 0.54/0.59 [3]~P1(a2,a4) % 0.54/0.59 [2]P1(f3(a1,a2),f3(a1,a4)) % 0.54/0.59 [1]P1(x11,x11) % 0.54/0.59 [4]~P2(x41,x41) % 0.54/0.59 [8]~P2(x81,x82)+P2(f3(a1,x81),f3(a1,x82)) % 0.54/0.59 [5]P2(x52,x51)+P2(x51,x52)+P1(x51,x52) % 0.54/0.59 [6]~P1(x63,x61)+P1(x61,x62)+~P1(x63,x62) % 0.54/0.59 [9]~P1(x92,x94)+~P1(x91,x93)+P1(f3(x91,x92),f3(x93,x94)) % 0.54/0.59 [7]~P2(x73,x74)+P2(x71,x72)+~P1(x73,x71)+~P1(x74,x72) % 0.54/0.59 %EqnAxiom % 0.54/0.59 % 0.54/0.59 %------------------------------------------- % 0.54/0.59 cnf(10,plain, % 0.54/0.59 (P1(f3(a1,a4),f3(a1,a2))), % 0.54/0.59 inference(scs_inference,[],[2,1,6])). % 0.54/0.59 cnf(11,plain, % 0.54/0.59 (P1(x111,x111)), % 0.54/0.59 inference(rename_variables,[],[1])). % 0.54/0.59 cnf(17,plain, % 0.54/0.59 (~P2(a4,a2)), % 0.54/0.59 inference(scs_inference,[],[2,1,11,4,6,7,8])). % 0.54/0.59 cnf(26,plain, % 0.54/0.59 (P2(f3(a1,a2),f3(a1,a4))), % 0.54/0.59 inference(scs_inference,[],[3,17,5,8])). % 0.54/0.59 cnf(27,plain, % 0.54/0.59 ($false), % 0.54/0.59 inference(scs_inference,[],[1,26,10,4,7]), % 0.54/0.59 ['proof']). % 0.54/0.59 % SZS output end Proof % 0.54/0.59 % Total time :0.000000s %------------------------------------------------------------------------------