TSTP Solution File: LCL086-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL086-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:10 EDT 2023
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 19 unt; 3 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 95 ( 46 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,
a: $i ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(X5,implies(implies(X4,X1),implies(X3,X1))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
cnf(prove_ic_1,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(X5,implies(implies(X4,X1),implies(X3,X1))))),
ic_JLukasiewicz_4 ).
cnf(c_0_5,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(implies(X3,X5),implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),implies(X4,X3)),implies(X3,X5)),implies(X6,implies(X3,X5))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_18]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X4),implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X2,X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(a,a)),
prove_ic_1 ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n028.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:38:20 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.53 start to proof: theBenchmark
% 0.19/0.54 % Version : CSE_E---1.5
% 0.19/0.54 % Problem : theBenchmark.p
% 0.19/0.54 % Proof found
% 0.19/0.54 % SZS status Theorem for theBenchmark.p
% 0.19/0.54 % SZS output start Proof
% See solution above
% 0.19/0.55 % Total time : 0.006000 s
% 0.19/0.55 % SZS output end Proof
% 0.19/0.55 % Total time : 0.009000 s
%------------------------------------------------------------------------------