%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN071-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n029.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:04:27 EDT 2024 % Result : Unsatisfiable 0.20s 0.59s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYN071-1 : TPTP v8.2.0. Released v1.0.0. % 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n029.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 23:32:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.54 start to proof:theBenchmark % 0.20/0.58 %------------------------------------------- % 0.20/0.58 % File :CSE---1.7 % 0.20/0.58 % Problem :theBenchmark % 0.20/0.58 % Transform :cnf % 0.20/0.58 % Format :tptp:raw % 0.20/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.58 % 0.20/0.58 % Result :Theorem 0.000000s % 0.20/0.58 % Output :CNFRefutation 0.000000s % 0.20/0.58 %------------------------------------------- % 0.20/0.59 %-------------------------------------------------------------------------- % 0.20/0.59 % File : SYN071-1 : TPTP v8.2.0. Released v1.0.0. % 0.20/0.59 % Domain : Syntactic % 0.20/0.59 % Problem : Pelletier Problem 48 % 0.20/0.59 % Version : Especial. % 0.20/0.59 % English : % 0.20/0.59 % 0.20/0.59 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.20/0.59 % : [Rud93] Rudnicki (1993), Email to G. Sutcliffe % 0.20/0.59 % Source : [Pel86] % 0.20/0.59 % Names : Pelletier 48 [Pel86] % 0.20/0.59 % 0.20/0.59 % Status : Unsatisfiable % 0.20/0.59 % Rating : 0.00 v6.1.0, 0.12 v6.0.0, 0.00 v2.4.0, 0.00 v2.2.0, 0.25 v2.1.0, 0.00 v2.0.0 % 0.20/0.59 % Syntax : Number of clauses : 4 ( 2 unt; 2 nHn; 4 RR) % 0.20/0.59 % Number of literals : 6 ( 6 equ; 2 neg) % 0.20/0.59 % Maximal clause size : 2 ( 1 avg) % 0.20/0.59 % Maximal term depth : 1 ( 1 avg) % 0.20/0.59 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty) % 0.20/0.59 % Number of functors : 4 ( 4 usr; 4 con; 0-0 aty) % 0.20/0.59 % Number of variables : 0 ( 0 sgn) % 0.20/0.59 % SPC : CNF_UNS_EPR_PEQ_NUE % 0.20/0.59 % 0.20/0.59 % Comments : [Pel86] says that Rudnicki has not published this problem % 0.20/0.59 % anywhere. % 0.20/0.59 % : [Rud93] says "I have seen it for the first time around 1977, % 0.20/0.59 % it was shown to me by A. Trybulec but I am sure it is folklore." % 0.20/0.59 %-------------------------------------------------------------------------- % 0.20/0.59 cnf(clause_1,axiom, % 0.20/0.59 ( a = b % 0.20/0.59 | c = d ) ). % 0.20/0.59 % 0.20/0.59 cnf(clause_2,axiom, % 0.20/0.59 ( a = c % 0.20/0.59 | b = d ) ). % 0.20/0.59 % 0.20/0.59 cnf(clause_3,negated_conjecture, % 0.20/0.59 a != d ). % 0.20/0.59 % 0.20/0.59 cnf(clause_4,negated_conjecture, % 0.20/0.59 b != c ). % 0.20/0.59 % 0.20/0.59 %-------------------------------------------------------------------------- % 0.20/0.59 %------------------------------------------- % 0.20/0.59 % Proof found % 0.20/0.59 % SZS status Theorem for theBenchmark % 0.20/0.59 % SZS output start Proof % 0.20/0.59 %ClaNum:7(EqnAxiom:3) % 0.20/0.59 %VarNum:0(SingletonVarNum:0) % 0.20/0.59 %MaxLitNum:2 % 0.20/0.59 %MaxfuncDepth:0 % 0.20/0.59 %SharedTerms:10 % 0.20/0.59 %goalClause: 4 5 % 0.20/0.59 %singleGoalClaCount:2 % 0.20/0.59 [4]~E(a1,a3) % 0.20/0.59 [5]~E(a4,a2) % 0.20/0.59 [6]E(a1,a2)+E(a3,a4) % 0.20/0.59 [7]E(a3,a2)+E(a1,a4) % 0.20/0.59 %EqnAxiom % 0.20/0.59 [1]E(x11,x11) % 0.20/0.59 [2]E(x22,x21)+~E(x21,x22) % 0.20/0.59 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.20/0.59 % 0.20/0.59 %------------------------------------------- % 0.20/0.59 cnf(9,plain, % 0.20/0.59 (E(a2,a3)+E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[7,2])). % 0.20/0.59 cnf(12,plain, % 0.20/0.59 (~E(a1,a2)+E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[4,9,3])). % 0.20/0.59 cnf(13,plain, % 0.20/0.59 (E(a1,a4)+E(a3,a4)), % 0.20/0.59 inference(scs_inference,[],[12,6])). % 0.20/0.59 cnf(14,plain, % 0.20/0.59 (E(a4,a1)+E(a3,a4)), % 0.20/0.59 inference(scs_inference,[],[13,2])). % 0.20/0.59 cnf(15,plain, % 0.20/0.59 (~E(a1,a2)+E(a3,a4)), % 0.20/0.59 inference(scs_inference,[],[5,14,3])). % 0.20/0.59 cnf(16,plain, % 0.20/0.59 (E(a3,a4)), % 0.20/0.59 inference(scs_inference,[],[15,6])). % 0.20/0.59 cnf(17,plain, % 0.20/0.59 (E(a4,a3)), % 0.20/0.59 inference(scs_inference,[],[16,2])). % 0.20/0.59 cnf(18,plain, % 0.20/0.59 (~E(a2,a1)+E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[2,12])). % 0.20/0.59 cnf(19,plain, % 0.20/0.59 (~E(x191,a1)+~E(a2,x191)+E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[18,3])). % 0.20/0.59 cnf(20,plain, % 0.20/0.59 (~E(a3,a1)+E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[19,9])). % 0.20/0.59 cnf(21,plain, % 0.20/0.59 (~E(a3,a1)), % 0.20/0.59 inference(scs_inference,[],[17,4,20,3])). % 0.20/0.59 cnf(22,plain, % 0.20/0.59 (~E(a1,a4)), % 0.20/0.59 inference(scs_inference,[],[21,17,2,3])). % 0.20/0.59 cnf(24,plain, % 0.20/0.59 (E(a2,a3)), % 0.20/0.59 inference(scs_inference,[],[22,9])). % 0.20/0.59 cnf(29,plain, % 0.20/0.59 ($false), % 0.20/0.59 inference(scs_inference,[],[24,5,16,3,2]), % 0.20/0.59 ['proof']). % 0.20/0.59 % SZS output end Proof % 0.20/0.59 % Total time :0.000000s %------------------------------------------------------------------------------