TSTP Solution File: LCL115-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL115-1 : 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 : 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:21 EDT 2023
% Result : Unsatisfiable 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 27 unt; 5 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 11 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
implies: ( $i * $i ) > $i ).
tff(decl_23,type,
is_a_theorem: $i > $o ).
tff(decl_24,type,
not: $i > $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $i ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_39,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_39) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X1,X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(not(X2),not(X1)),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(X1),not(implies(X2,X2))),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(not(not(X1)),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(not(X1)),not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
prove_mv_39 ).
cnf(c_0_35,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL115-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 17:18:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.041000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.043000 s
%------------------------------------------------------------------------------