%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MSC005-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 : n025.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 11:52:10 EDT 2024 % Result : Unsatisfiable 0.60s 0.65s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : MSC005-1 : TPTP v8.2.0. Released v1.0.0. % 0.00/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.10/0.32 % Computer : n025.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 300 % 0.10/0.32 % DateTime : Sat Jun 22 05:52:39 EDT 2024 % 0.10/0.32 % CPUTime : % 0.58/0.60 start to proof:theBenchmark % 0.60/0.64 %------------------------------------------- % 0.60/0.64 % File :CSE---1.7 % 0.60/0.64 % Problem :theBenchmark % 0.60/0.64 % Transform :cnf % 0.60/0.64 % Format :tptp:raw % 0.60/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.64 % 0.60/0.64 % Result :Theorem 0.000000s % 0.60/0.64 % Output :CNFRefutation 0.000000s % 0.60/0.64 %------------------------------------------- % 0.60/0.64 %-------------------------------------------------------------------------- % 0.60/0.64 % File : MSC005-1 : TPTP v8.2.0. Released v1.0.0. % 0.60/0.64 % Domain : Miscellaneous % 0.60/0.64 % Problem : The evaluation of XOR expressions % 0.60/0.64 % Version : [Pla82] axioms. % 0.60/0.64 % English : % 0.60/0.64 % 0.60/0.64 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format % 0.60/0.64 % Source : [Pla82] % 0.60/0.64 % Names : Problem 5.1 [Pla82] % 0.60/0.64 % 0.60/0.64 % Status : Unsatisfiable % 0.60/0.64 % Rating : 0.00 v7.4.0, 0.17 v7.3.0, 0.00 v5.4.0, 0.06 v5.3.0, 0.05 v5.2.0, 0.00 v2.0.0 % 0.60/0.64 % Syntax : Number of clauses : 7 ( 3 unt; 0 nHn; 7 RR) % 0.60/0.64 % Number of literals : 15 ( 0 equ; 9 neg) % 0.60/0.64 % Maximal clause size : 3 ( 2 avg) % 0.60/0.64 % Maximal term depth : 5 ( 1 avg) % 0.60/0.64 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.60/0.64 % Number of functors : 3 ( 3 usr; 2 con; 0-2 aty) % 0.60/0.64 % Number of variables : 9 ( 1 sgn) % 0.60/0.64 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.60/0.64 % 0.60/0.64 % Comments : % 0.60/0.64 %-------------------------------------------------------------------------- % 0.60/0.64 cnf(true_is_true,axiom, % 0.60/0.64 value(truth,truth) ). % 0.60/0.64 % 0.60/0.64 cnf(false_is_false,axiom, % 0.60/0.64 value(falsity,falsity) ). % 0.60/0.64 % 0.60/0.64 cnf(true_xor_true,axiom, % 0.60/0.64 ( ~ value(X,truth) % 0.60/0.64 | ~ value(Y,truth) % 0.60/0.64 | value(xor(X,Y),falsity) ) ). % 0.60/0.64 % 0.60/0.64 cnf(true_xor_false,axiom, % 0.60/0.64 ( ~ value(X,truth) % 0.60/0.64 | ~ value(Y,falsity) % 0.60/0.64 | value(xor(X,Y),truth) ) ). % 0.60/0.64 % 0.60/0.64 cnf(false_xor_true,axiom, % 0.60/0.64 ( ~ value(X,falsity) % 0.60/0.64 | ~ value(Y,truth) % 0.60/0.64 | value(xor(X,Y),truth) ) ). % 0.60/0.64 % 0.60/0.64 cnf(false_xor_false,axiom, % 0.60/0.64 ( ~ value(X,falsity) % 0.60/0.64 | ~ value(Y,falsity) % 0.60/0.64 | value(xor(X,Y),falsity) ) ). % 0.60/0.64 % 0.60/0.64 cnf(evaluate_expression,negated_conjecture, % 0.60/0.64 ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value) ). % 0.60/0.64 % 0.60/0.64 %-------------------------------------------------------------------------- % 0.60/0.64 %------------------------------------------- % 0.60/0.65 % Proof found % 0.60/0.65 % SZS status Theorem for theBenchmark % 0.60/0.65 % SZS output start Proof % 0.60/0.65 %ClaNum:7(EqnAxiom:0) % 0.60/0.65 %VarNum:17(SingletonVarNum:9) % 0.60/0.65 %MaxLitNum:3 % 0.60/0.65 %MaxfuncDepth:4 % 0.60/0.65 %SharedTerms:8 % 0.60/0.65 %goalClause: 3 % 0.60/0.65 %singleGoalClaCount:1 % 0.60/0.65 [1]P1(a1,a1) % 0.60/0.65 [2]P1(a2,a2) % 0.60/0.65 [3]~P1(f3(f3(f3(f3(a1,a2),a2),a1),a2),x31) % 0.60/0.65 [4]~P1(x42,a1)+~P1(x41,a2)+P1(f3(x41,x42),a1) % 0.60/0.65 [5]~P1(x52,a2)+~P1(x51,a1)+P1(f3(x51,x52),a1) % 0.60/0.65 [6]~P1(x62,a1)+~P1(x61,a1)+P1(f3(x61,x62),a2) % 0.60/0.65 [7]~P1(x72,a2)+~P1(x71,a2)+P1(f3(x71,x72),a2) % 0.60/0.65 %EqnAxiom % 0.60/0.65 % 0.60/0.65 %------------------------------------------- % 0.60/0.65 cnf(9,plain, % 0.60/0.65 (~P1(f3(f3(f3(f3(a1,a2),a2),a1),a2),x91)), % 0.60/0.65 inference(rename_variables,[],[3])). % 0.60/0.65 cnf(14,plain, % 0.60/0.65 (~P1(f3(f3(a1,a2),a2),a2)), % 0.60/0.65 inference(scs_inference,[],[3,9,1,2,5,7,4])). % 0.60/0.65 cnf(16,plain, % 0.60/0.65 (~P1(f3(f3(a1,a2),a2),a1)), % 0.60/0.65 inference(scs_inference,[],[3,9,1,2,5,7,4,6])). % 0.60/0.65 cnf(18,plain, % 0.60/0.65 (~P1(f3(a1,a2),a1)), % 0.60/0.65 inference(scs_inference,[],[16,2,5])). % 0.60/0.65 cnf(20,plain, % 0.60/0.65 (~P1(f3(a1,a2),a2)), % 0.60/0.65 inference(scs_inference,[],[14,16,2,5,7])). % 0.60/0.65 cnf(26,plain, % 0.60/0.65 ($false), % 0.60/0.65 inference(scs_inference,[],[20,18,1,2,6,5]), % 0.60/0.65 ['proof']). % 0.60/0.65 % SZS output end Proof % 0.60/0.65 % Total time :0.000000s %------------------------------------------------------------------------------