TSTP Solution File: LCL109-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL109-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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:17 EDT 2023
% Result : Unsatisfiable 0.77s 0.88s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 34 ( 29 unt; 5 typ; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
truth: $i ).
tff(decl_23,type,
implies: ( $i * $i ) > $i ).
tff(decl_24,type,
not: $i > $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $i ).
cnf(prove_wajsberg_mv_4,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).
cnf(lemma_10,axiom,
implies(not(X1),not(X2)) = implies(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(lemma_9,axiom,
not(not(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9) ).
cnf(lemma_7,axiom,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(lemma_4,axiom,
implies(X1,implies(X2,X1)) = truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4) ).
cnf(lemma_8,axiom,
implies(X1,not(truth)) = not(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_8) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_0_9,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
prove_wajsberg_mv_4 ).
cnf(c_0_10,axiom,
implies(not(X1),not(X2)) = implies(X2,X1),
lemma_10 ).
cnf(c_0_11,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_12,axiom,
not(not(X1)) = X1,
lemma_9 ).
cnf(c_0_13,negated_conjecture,
implies(not(implies(b,a)),not(implies(implies(a,b),implies(b,a)))) != truth,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
implies(not(X1),not(implies(X2,X1))) = implies(not(X2),not(implies(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).
cnf(c_0_15,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,axiom,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
lemma_7 ).
cnf(c_0_17,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_18,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_19,axiom,
implies(X1,implies(X2,X1)) = truth,
lemma_4 ).
cnf(c_0_20,axiom,
implies(X1,not(truth)) = not(X1),
lemma_8 ).
cnf(c_0_21,negated_conjecture,
implies(not(implies(a,b)),not(implies(implies(b,a),implies(a,b)))) != truth,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
implies(implies(not(X1),X2),implies(not(X3),implies(implies(X1,X3),not(implies(X2,not(implies(X3,X1))))))) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_16]),c_0_18]) ).
cnf(c_0_24,plain,
implies(implies(X1,X2),not(implies(not(X1),not(implies(X2,X1))))) = not(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_14]),c_0_12]),c_0_12]),c_0_18]),c_0_12]),c_0_19]),c_0_20]) ).
cnf(c_0_25,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_26,negated_conjecture,
implies(a,implies(not(b),not(implies(a,implies(not(b),not(implies(b,a))))))) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_16]),c_0_10]),c_0_12]),c_0_10]) ).
cnf(c_0_27,plain,
implies(X1,implies(not(X2),not(implies(X1,implies(not(X2),not(implies(X2,X1))))))) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12]),c_0_12]),c_0_18]),c_0_12]),c_0_19]),c_0_12]),c_0_25]),c_0_16]),c_0_10]),c_0_16]),c_0_10]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL109-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 02:15:11 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.77/0.88 % Version : CSE_E---1.5
% 0.77/0.88 % Problem : theBenchmark.p
% 0.77/0.88 % Proof found
% 0.77/0.88 % SZS status Theorem for theBenchmark.p
% 0.77/0.88 % SZS output start Proof
% See solution above
% 0.77/0.89 % Total time : 0.296000 s
% 0.77/0.89 % SZS output end Proof
% 0.77/0.89 % Total time : 0.299000 s
%------------------------------------------------------------------------------