TSTP Solution File: LCL218-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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:59 EDT 2023
% Result : Unsatisfiable 3.22s 3.29s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 34 ( 26 unt; 8 typ; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 57 ( 8 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
or: ( $i * $i ) > $i ).
tff(decl_24,type,
not: $i > $i ).
tff(decl_25,type,
axiom: $i > $i ).
tff(decl_26,type,
true: $i ).
tff(decl_27,type,
theorem: $i > $i ).
tff(decl_28,type,
p: $i ).
tff(decl_29,type,
q: $i ).
cnf(rule_2,axiom,
ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(rule_3,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,axiom,
ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_9,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_10,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_11,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_12,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_13,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
rule_3 ).
cnf(c_0_14,plain,
ifeq(theorem(or(X1,or(X2,X3))),true,theorem(or(X2,or(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_15,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_17,plain,
ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(or(X2,X1)),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_10]) ).
cnf(c_0_18,plain,
theorem(or(X1,or(not(or(X2,X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10]) ).
cnf(c_0_19,plain,
ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_10]) ).
cnf(c_0_20,plain,
theorem(or(not(or(X1,X2)),or(not(or(X3,not(or(X2,X1)))),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10]) ).
cnf(c_0_21,plain,
theorem(or(not(X1),or(not(or(X2,not(or(X1,X3)))),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]) ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,not(or(X2,X3)))),or(not(X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_10]) ).
cnf(c_0_23,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
prove_this ).
cnf(c_0_24,plain,
theorem(or(not(or(not(or(X1,X2)),X3)),or(not(X1),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_10]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.36 % Computer : n016.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Fri Aug 25 07:00:10 EDT 2023
% 0.17/0.36 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 3.22/3.29 % Version : CSE_E---1.5
% 3.22/3.29 % Problem : theBenchmark.p
% 3.22/3.29 % Proof found
% 3.22/3.29 % SZS status Theorem for theBenchmark.p
% 3.22/3.29 % SZS output start Proof
% See solution above
% 3.22/3.29 % Total time : 2.691000 s
% 3.22/3.29 % SZS output end Proof
% 3.22/3.29 % Total time : 2.694000 s
%------------------------------------------------------------------------------