TSTP Solution File: MSC005-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n028.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 : Thu Aug 31 09:20:42 EDT 2023
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n028.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 : Thu Aug 24 14:05:35 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.20/0.52 start to proof:theBenchmark
% 0.20/0.57 %-------------------------------------------
% 0.20/0.57 % File :CSE---1.6
% 0.20/0.57 % Problem :theBenchmark
% 0.20/0.57 % Transform :cnf
% 0.20/0.57 % Format :tptp:raw
% 0.20/0.57 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.57
% 0.20/0.57 % Result :Theorem 0.000000s
% 0.20/0.57 % Output :CNFRefutation 0.000000s
% 0.20/0.57 %-------------------------------------------
% 0.20/0.57 %--------------------------------------------------------------------------
% 0.20/0.57 % File : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.57 % Domain : Miscellaneous
% 0.20/0.57 % Problem : The evaluation of XOR expressions
% 0.20/0.57 % Version : [Pla82] axioms.
% 0.20/0.57 % English :
% 0.20/0.57
% 0.20/0.57 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format
% 0.20/0.57 % Source : [Pla82]
% 0.20/0.57 % Names : Problem 5.1 [Pla82]
% 0.20/0.57
% 0.20/0.57 % Status : Unsatisfiable
% 0.20/0.57 % 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.20/0.57 % Syntax : Number of clauses : 7 ( 3 unt; 0 nHn; 7 RR)
% 0.20/0.57 % Number of literals : 15 ( 0 equ; 9 neg)
% 0.20/0.57 % Maximal clause size : 3 ( 2 avg)
% 0.20/0.57 % Maximal term depth : 5 ( 1 avg)
% 0.20/0.57 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 0.20/0.57 % Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% 0.20/0.57 % Number of variables : 9 ( 1 sgn)
% 0.20/0.57 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.57
% 0.20/0.57 % Comments :
% 0.20/0.57 %--------------------------------------------------------------------------
% 0.20/0.57 cnf(true_is_true,axiom,
% 0.20/0.57 value(truth,truth) ).
% 0.20/0.57
% 0.20/0.57 cnf(false_is_false,axiom,
% 0.20/0.57 value(falsity,falsity) ).
% 0.20/0.57
% 0.20/0.57 cnf(true_xor_true,axiom,
% 0.20/0.57 ( ~ value(X,truth)
% 0.20/0.57 | ~ value(Y,truth)
% 0.20/0.57 | value(xor(X,Y),falsity) ) ).
% 0.20/0.57
% 0.20/0.57 cnf(true_xor_false,axiom,
% 0.20/0.57 ( ~ value(X,truth)
% 0.20/0.57 | ~ value(Y,falsity)
% 0.20/0.57 | value(xor(X,Y),truth) ) ).
% 0.20/0.57
% 0.20/0.57 cnf(false_xor_true,axiom,
% 0.20/0.57 ( ~ value(X,falsity)
% 0.20/0.57 | ~ value(Y,truth)
% 0.20/0.57 | value(xor(X,Y),truth) ) ).
% 0.20/0.57
% 0.20/0.57 cnf(false_xor_false,axiom,
% 0.20/0.57 ( ~ value(X,falsity)
% 0.20/0.57 | ~ value(Y,falsity)
% 0.20/0.57 | value(xor(X,Y),falsity) ) ).
% 0.20/0.57
% 0.20/0.57 cnf(evaluate_expression,negated_conjecture,
% 0.20/0.57 ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value) ).
% 0.20/0.57
% 0.20/0.57 %--------------------------------------------------------------------------
% 0.20/0.57 %-------------------------------------------
% 0.20/0.57 % Proof found
% 0.20/0.57 % SZS status Theorem for theBenchmark
% 0.20/0.57 % SZS output start Proof
% 0.20/0.57 %ClaNum:7(EqnAxiom:0)
% 0.20/0.57 %VarNum:17(SingletonVarNum:9)
% 0.20/0.57 %MaxLitNum:3
% 0.20/0.57 %MaxfuncDepth:4
% 0.20/0.57 %SharedTerms:8
% 0.20/0.57 %goalClause: 3
% 0.20/0.57 %singleGoalClaCount:1
% 0.20/0.57 [1]P1(a1,a1)
% 0.20/0.57 [2]P1(a2,a2)
% 0.20/0.57 [3]~P1(f3(f3(f3(f3(a1,a2),a2),a1),a2),x31)
% 0.20/0.57 [4]~P1(x42,a1)+~P1(x41,a2)+P1(f3(x41,x42),a1)
% 0.20/0.57 [5]~P1(x52,a2)+~P1(x51,a1)+P1(f3(x51,x52),a1)
% 0.20/0.57 [6]~P1(x62,a1)+~P1(x61,a1)+P1(f3(x61,x62),a2)
% 0.20/0.57 [7]~P1(x72,a2)+~P1(x71,a2)+P1(f3(x71,x72),a2)
% 0.20/0.57 %EqnAxiom
% 0.20/0.57
% 0.20/0.57 %-------------------------------------------
% 0.20/0.57 cnf(9,plain,
% 0.20/0.57 (~P1(f3(f3(f3(f3(a1,a2),a2),a1),a2),x91)),
% 0.20/0.57 inference(rename_variables,[],[3])).
% 0.20/0.57 cnf(10,plain,
% 0.20/0.57 (~P1(f3(f3(a1,a2),a2),a1)),
% 0.20/0.58 inference(scs_inference,[],[3,1,2,7,6])).
% 0.20/0.58 cnf(15,plain,
% 0.20/0.58 (~P1(f3(f3(a1,a2),a2),a2)),
% 0.20/0.58 inference(scs_inference,[],[3,9,1,2,7,6,5,4])).
% 0.20/0.58 cnf(21,plain,
% 0.20/0.58 (P1(f3(a1,a2),a1)),
% 0.20/0.58 inference(scs_inference,[],[1,2,7,6,5])).
% 0.20/0.58 cnf(37,plain,
% 0.20/0.58 ($false),
% 0.20/0.58 inference(scs_inference,[],[2,21,15,10,7,6,5]),
% 0.20/0.58 ['proof']).
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time :0.000000s
%------------------------------------------------------------------------------