TSTP Solution File: LCL113-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL113-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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:20 EDT 2023
% Result : Unsatisfiable 25.20s 25.20s
% Output : CNFRefutation 25.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 49 ( 42 unt; 7 typ; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 101 ( 14 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
implies: ( $i * $i ) > $i ).
tff(decl_24,type,
is_a_theorem: $i > $i ).
tff(decl_25,type,
true: $i ).
tff(decl_26,type,
not: $i > $i ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
b: $i ).
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_33,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_33) ).
cnf(c_0_7,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
mv_1 ).
cnf(c_0_9,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
mv_2 ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_13,plain,
ifeq(is_a_theorem(implies(implies(X1,X2),X3)),true,is_a_theorem(implies(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_9]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))) = true,
mv_3 ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) = true,
mv_5 ).
cnf(c_0_17,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_9]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_9]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(not(X1),implies(X1,X2)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]) ).
cnf(c_0_21,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),not(X2)),implies(X2,X1)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_9]) ).
cnf(c_0_24,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X2,X3),implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_9]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]) ).
cnf(c_0_26,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(X1,implies(X2,X1)),X3),X3),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_23]),c_0_9]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(not(X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_9]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_9]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(implies(not(X1),not(X2))),true,is_a_theorem(implies(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_9]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(not(not(X1)),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_9]) ).
cnf(c_0_31,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_28]),c_0_9]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_9]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,not(not(X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_9]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_9]) ).
cnf(c_0_35,plain,
ifeq(is_a_theorem(implies(implies(X1,not(not(X1))),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_33]),c_0_9]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_9]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_9]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(X1,not(not(X2))),X3),implies(implies(X1,X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_37]),c_0_9]) ).
cnf(c_0_39,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
prove_mv_33 ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_38]),c_0_9]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL113-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n027.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 05:49:33 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.61 start to proof: theBenchmark
% 25.20/25.20 % Version : CSE_E---1.5
% 25.20/25.20 % Problem : theBenchmark.p
% 25.20/25.20 % Proof found
% 25.20/25.20 % SZS status Theorem for theBenchmark.p
% 25.20/25.20 % SZS output start Proof
% See solution above
% 25.20/25.21 % Total time : 24.593000 s
% 25.20/25.21 % SZS output end Proof
% 25.20/25.21 % Total time : 24.597000 s
%------------------------------------------------------------------------------