TSTP Solution File: LCL118-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL118-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 : n024.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:22 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 12 unt; 5 typ; 0 def)
% Number of atoms : 37 ( 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 : 5 ( 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 : 56 ( 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/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(wo,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wo) ).
cnf(prove_yqm,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yqm) ).
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,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
wo ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1))))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4))))
| ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X3,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X3,equivalent(X1,X2))))),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X3))))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X3)))
| ~ is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_4]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
prove_yqm ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X3,X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL118-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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 19:53:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.007000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.010000 s
%------------------------------------------------------------------------------