TSTP Solution File: LCL109-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL109-2 : 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 : n005.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.82s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 47 unt; 5 typ; 0 def)
% Number of atoms : 47 ( 46 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 6 ( 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 : 82 ( 10 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(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(prove_wajsberg_mv_4,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).
cnf(c_0_5,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_6,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_7,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_8,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]) ).
cnf(c_0_11,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_6]),c_0_6]) ).
cnf(c_0_14,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_15,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_6]) ).
cnf(c_0_16,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,plain,
implies(not(truth),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).
cnf(c_0_18,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_6]) ).
cnf(c_0_19,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_17]),c_0_6]) ).
cnf(c_0_20,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_6]),c_0_16]),c_0_6]) ).
cnf(c_0_23,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_17]),c_0_6]) ).
cnf(c_0_24,plain,
implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_6]) ).
cnf(c_0_26,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_6]) ).
cnf(c_0_27,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_6]),c_0_14]),c_0_6]) ).
cnf(c_0_28,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_23]),c_0_23]) ).
cnf(c_0_29,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_6]) ).
cnf(c_0_30,plain,
implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_6]) ).
cnf(c_0_31,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_6]),c_0_29]),c_0_6]) ).
cnf(c_0_33,plain,
implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_7]) ).
cnf(c_0_34,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
implies(not(implies(X1,X2)),not(X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_23]) ).
cnf(c_0_36,plain,
implies(X1,implies(not(X1),X2)) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_37,plain,
implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
implies(X1,not(implies(X2,not(implies(X2,X1))))) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_27]),c_0_34]),c_0_34]) ).
cnf(c_0_39,plain,
implies(not(implies(X1,not(X2))),X2) = truth,
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_40,plain,
implies(implies(implies(not(X1),X2),X1),X1) = implies(not(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_36]),c_0_6]) ).
cnf(c_0_41,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
prove_wajsberg_mv_4 ).
cnf(c_0_42,plain,
implies(X1,implies(implies(X2,not(implies(X2,X1))),X3)) = implies(X1,implies(not(X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_37]),c_0_27]) ).
cnf(c_0_43,plain,
implies(not(implies(X1,X2)),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28]) ).
cnf(c_0_44,negated_conjecture,
implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_32]),c_0_32]) ).
cnf(c_0_45,plain,
implies(X1,implies(implies(X2,X1),X2)) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_7]),c_0_43]),c_0_6]),c_0_28]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL109-2 : TPTP v8.1.2. 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 : n005.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 18:44:08 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.77/0.82 % Version : CSE_E---1.5
% 0.77/0.82 % Problem : theBenchmark.p
% 0.77/0.82 % Proof found
% 0.77/0.82 % SZS status Theorem for theBenchmark.p
% 0.77/0.82 % SZS output start Proof
% See solution above
% 0.77/0.83 % Total time : 0.270000 s
% 0.77/0.83 % SZS output end Proof
% 0.77/0.83 % Total time : 0.273000 s
%------------------------------------------------------------------------------