TSTP Solution File: LCL161-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL161-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 %d %s
% 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 06:52:33 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 30 ( 23 unt; 7 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
not: $i > $i ).
tff(decl_23,type,
truth: $i ).
tff(decl_24,type,
xor: ( $i * $i ) > $i ).
tff(decl_25,type,
falsehood: $i ).
tff(decl_26,type,
and_star: ( $i * $i ) > $i ).
tff(decl_27,type,
implies: ( $i * $i ) > $i ).
tff(decl_28,type,
x: $i ).
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(truth,x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
cnf(implies_definition,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_commutativity) ).
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
cnf(axiom_3,axiom,
xor(X1,X1) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_3) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(c_0_8,negated_conjecture,
implies(truth,x) != x,
prove_wajsberg_axiom ).
cnf(c_0_9,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_10,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_11,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_12,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_13,axiom,
xor(X1,X1) = falsehood,
axiom_3 ).
cnf(c_0_14,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_15,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_16,negated_conjecture,
xor(truth,and_star(truth,xor(truth,x))) != x,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,plain,
and_star(truth,X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
xor(X1,xor(truth,xor(truth,X2))) = xor(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_13]),c_0_14]),c_0_12]) ).
cnf(c_0_19,plain,
xor(falsehood,X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
xor(truth,xor(truth,x)) != x,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
xor(truth,xor(truth,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL161-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 06:06:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 start to proof: theBenchmark
% 0.20/0.62 % Version : CSE_E---1.5
% 0.20/0.62 % Problem : theBenchmark.p
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark.p
% 0.20/0.62 % SZS output start Proof
% See solution above
% 0.20/0.62 % Total time : 0.005000 s
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time : 0.007000 s
%------------------------------------------------------------------------------