TSTP Solution File: LCL239-10 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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:53:09 EDT 2023
% Result : Unsatisfiable 0.24s 0.68s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 34 unt; 9 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 61 ( 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,
implies: ( $i * $i ) > $i ).
tff(decl_25,type,
axiom: $i > $i ).
tff(decl_26,type,
true: $i ).
tff(decl_27,type,
not: $i > $i ).
tff(decl_28,type,
theorem: $i > $i ).
tff(decl_29,type,
and: ( $i * $i ) > $i ).
tff(decl_30,type,
p: $i ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
cnf(c_0_9,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_12,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_13,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_17,plain,
ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_18,plain,
theorem(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
ifeq(theorem(or(not(or(not(X1),or(X2,X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_14]) ).
cnf(c_0_23,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_14]) ).
cnf(c_0_24,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_25,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_14]) ).
cnf(c_0_26,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_14]) ).
cnf(c_0_27,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14]) ).
cnf(c_0_28,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
prove_this ).
cnf(c_0_29,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_30,plain,
ifeq(theorem(X1),true,theorem(not(not(X1))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_14]) ).
cnf(c_0_31,negated_conjecture,
theorem(not(not(or(not(p),not(not(p)))))) != true,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
theorem(not(not(or(X1,not(X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_14]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% 0.15/0.16 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.16/0.39 % Computer : n021.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Fri Aug 25 06:06:56 EDT 2023
% 0.16/0.39 % CPUTime :
% 0.24/0.65 start to proof: theBenchmark
% 0.24/0.68 % Version : CSE_E---1.5
% 0.24/0.68 % Problem : theBenchmark.p
% 0.24/0.68 % Proof found
% 0.24/0.68 % SZS status Theorem for theBenchmark.p
% 0.24/0.68 % SZS output start Proof
% See solution above
% 0.24/0.69 % Total time : 0.019000 s
% 0.24/0.69 % SZS output end Proof
% 0.24/0.69 % Total time : 0.021000 s
%------------------------------------------------------------------------------