TSTP Solution File: LCL016-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL016-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 : n012.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:51:48 EDT 2023
% Result : Unsatisfiable 0.22s 0.66s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 18 unt; 5 typ; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 118 ( 60 ~; 58 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 144 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equivalent: ( $i * $i ) > $i ).
tff(decl_23,type,
is_a_theorem: $i > $o ).
tff(decl_24,type,
a: $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
c: $i ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(yro,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X3,X2),X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',yro) ).
cnf(prove_yrm,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yrm) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X3,X2),X1)))),
yro ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,X2),X3)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,X3),X4))))
| ~ is_a_theorem(equivalent(X4,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X2))
| ~ is_a_theorem(equivalent(X4,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(X4,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X4,X3))
| ~ is_a_theorem(equivalent(X2,X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X3,X4),X2),X1),X4))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_13,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X3,X4),X1))))
| ~ is_a_theorem(equivalent(X4,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),X2))
| ~ is_a_theorem(equivalent(X4,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),X4),X1),X3))
| ~ is_a_theorem(equivalent(X4,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4))
| ~ is_a_theorem(equivalent(X4,X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,X2),X3)),X4))
| ~ is_a_theorem(equivalent(X4,equivalent(X3,X2)))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_19,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X2,X3),X4)),X4))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,X2),X3)),X4))
| ~ is_a_theorem(equivalent(X4,equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),X3),X2),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_23,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_4]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X3)))),
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_6]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X3,X2),X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_25]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X2),X1),X3)),
inference(spm,[status(thm)],[c_0_29,c_0_4]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),X3),X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),X2)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),X2),X1),X3),X3)),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_36,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_34]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X1),X3),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X2),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X2,X3),X1),X3))),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_39,c_0_42]) ).
cnf(c_0_44,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X2,X3),X1))),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X3)),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))),
prove_yrm ).
cnf(c_0_48,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X2,X3),X1)))),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 25 06:32:56 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.60 start to proof: theBenchmark
% 0.22/0.66 % Version : CSE_E---1.5
% 0.22/0.66 % Problem : theBenchmark.p
% 0.22/0.66 % Proof found
% 0.22/0.66 % SZS status Theorem for theBenchmark.p
% 0.22/0.66 % SZS output start Proof
% See solution above
% 0.22/0.67 % Total time : 0.053000 s
% 0.22/0.67 % SZS output end Proof
% 0.22/0.67 % Total time : 0.055000 s
%------------------------------------------------------------------------------