TSTP Solution File: LCL065-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL065-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 : n001.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:03 EDT 2023
% Result : Unsatisfiable 0.87s 0.96s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 33 ~; 31 |; 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 88 ( 16 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 ).
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(cn_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
cnf(cn_49,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).
cnf(prove_cn_2,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_2) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
cn_49 ).
cnf(c_0_14,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(implies(implies(not(X1),not(X2)),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_30]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_31]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(not(X1),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
prove_cn_2 ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.33 % Computer : n001.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Fri Aug 25 03:46:27 EDT 2023
% 0.16/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.87/0.96 % Version : CSE_E---1.5
% 0.87/0.96 % Problem : theBenchmark.p
% 0.87/0.96 % Proof found
% 0.87/0.96 % SZS status Theorem for theBenchmark.p
% 0.87/0.96 % SZS output start Proof
% See solution above
% 0.87/0.96 % Total time : 0.403000 s
% 0.87/0.96 % SZS output end Proof
% 0.87/0.96 % Total time : 0.405000 s
%------------------------------------------------------------------------------