TSTP Solution File: LCL203-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL203-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:11:57 EDT 2023
% Result : Unsatisfiable 1.45s 0.64s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 4 RR)
% Number of literals : 42 ( 41 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 87 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',axiom_1_3) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.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/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',rule_2) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.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/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('/export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p',prove_this) ).
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,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,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_23,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_24,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_14]) ).
cnf(c_0_26,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14]) ).
cnf(c_0_27,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_14]) ).
cnf(c_0_28,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_25]),c_0_14]) ).
cnf(c_0_29,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_14]) ).
cnf(c_0_30,plain,
ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(or(X3,X1)),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_14]) ).
cnf(c_0_31,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14]) ).
cnf(c_0_32,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14]) ).
cnf(c_0_33,plain,
theorem(or(not(X1),not(not(or(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_14]) ).
cnf(c_0_34,plain,
ifeq(theorem(X1),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_35,plain,
theorem(or(not(not(or(X1,X2))),not(X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_14]) ).
cnf(c_0_36,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
prove_this ).
cnf(c_0_37,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_17,c_0_23]),c_0_14]) ).
cnf(c_0_38,plain,
theorem(or(X1,or(not(not(or(X2,X3))),not(X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_14]) ).
cnf(c_0_39,negated_conjecture,
theorem(or(not(not(or(p,q))),or(not(p),not(q)))) != true,
inference(rw,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_40,plain,
theorem(or(not(not(or(X1,X2))),or(X3,not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_14]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL203-10 : TPTP v8.1.2. Released v7.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:53:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RIPG69fFQf/E---3.1_13743.p
% 1.45/0.64 # Version: 3.1pre001
% 1.45/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.45/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.45/0.64 # Starting sh5l with 300s (1) cores
% 1.45/0.64 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 13876 completed with status 0
% 1.45/0.64 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.45/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.64 # No SInE strategy applied
% 1.45/0.64 # Search class: FUUPM-FFSF31-MFFFFFNN
% 1.45/0.64 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 1.45/0.64 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 1.45/0.64 # Starting new_bool_3 with 251s (1) cores
% 1.45/0.64 # Starting new_bool_1 with 251s (1) cores
% 1.45/0.64 # Starting sh5l with 247s (1) cores
% 1.45/0.64 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 13882 completed with status 0
% 1.45/0.64 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 1.45/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.64 # No SInE strategy applied
% 1.45/0.64 # Search class: FUUPM-FFSF31-MFFFFFNN
% 1.45/0.64 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 1.45/0.64 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 1.45/0.64 # Preprocessing time : 0.001 s
% 1.45/0.64
% 1.45/0.64 # Proof found!
% 1.45/0.64 # SZS status Unsatisfiable
% 1.45/0.64 # SZS output start CNFRefutation
% See solution above
% 1.45/0.64 # Parsed axioms : 10
% 1.45/0.64 # Removed by relevancy pruning/SinE : 0
% 1.45/0.64 # Initial clauses : 10
% 1.45/0.64 # Removed in clause preprocessing : 1
% 1.45/0.64 # Initial clauses in saturation : 9
% 1.45/0.64 # Processed clauses : 344
% 1.45/0.64 # ...of these trivial : 34
% 1.45/0.64 # ...subsumed : 0
% 1.45/0.64 # ...remaining for further processing : 310
% 1.45/0.64 # Other redundant clauses eliminated : 0
% 1.45/0.64 # Clauses deleted for lack of memory : 0
% 1.45/0.64 # Backward-subsumed : 0
% 1.45/0.64 # Backward-rewritten : 1
% 1.45/0.64 # Generated clauses : 11205
% 1.45/0.64 # ...of the previous two non-redundant : 2244
% 1.45/0.64 # ...aggressively subsumed : 0
% 1.45/0.64 # Contextual simplify-reflections : 0
% 1.45/0.64 # Paramodulations : 11205
% 1.45/0.64 # Factorizations : 0
% 1.45/0.64 # NegExts : 0
% 1.45/0.64 # Equation resolutions : 0
% 1.45/0.64 # Total rewrite steps : 14472
% 1.45/0.64 # Propositional unsat checks : 0
% 1.45/0.64 # Propositional check models : 0
% 1.45/0.64 # Propositional check unsatisfiable : 0
% 1.45/0.64 # Propositional clauses : 0
% 1.45/0.64 # Propositional clauses after purity: 0
% 1.45/0.64 # Propositional unsat core size : 0
% 1.45/0.64 # Propositional preprocessing time : 0.000
% 1.45/0.64 # Propositional encoding time : 0.000
% 1.45/0.64 # Propositional solver time : 0.000
% 1.45/0.64 # Success case prop preproc time : 0.000
% 1.45/0.64 # Success case prop encoding time : 0.000
% 1.45/0.64 # Success case prop solver time : 0.000
% 1.45/0.64 # Current number of processed clauses : 309
% 1.45/0.64 # Positive orientable unit clauses : 309
% 1.45/0.64 # Positive unorientable unit clauses: 0
% 1.45/0.64 # Negative unit clauses : 0
% 1.45/0.64 # Non-unit-clauses : 0
% 1.45/0.64 # Current number of unprocessed clauses: 1909
% 1.45/0.64 # ...number of literals in the above : 1909
% 1.45/0.64 # Current number of archived formulas : 0
% 1.45/0.64 # Current number of archived clauses : 2
% 1.45/0.64 # Clause-clause subsumption calls (NU) : 0
% 1.45/0.64 # Rec. Clause-clause subsumption calls : 0
% 1.45/0.64 # Non-unit clause-clause subsumptions : 0
% 1.45/0.64 # Unit Clause-clause subsumption calls : 0
% 1.45/0.64 # Rewrite failures with RHS unbound : 0
% 1.45/0.64 # BW rewrite match attempts : 10385
% 1.45/0.64 # BW rewrite match successes : 1
% 1.45/0.64 # Condensation attempts : 0
% 1.45/0.64 # Condensation successes : 0
% 1.45/0.64 # Termbank termtop insertions : 196993
% 1.45/0.64
% 1.45/0.64 # -------------------------------------------------
% 1.45/0.64 # User time : 0.130 s
% 1.45/0.64 # System time : 0.010 s
% 1.45/0.64 # Total time : 0.140 s
% 1.45/0.64 # Maximum resident set size: 1568 pages
% 1.45/0.64
% 1.45/0.64 # -------------------------------------------------
% 1.45/0.64 # User time : 0.678 s
% 1.45/0.64 # System time : 0.025 s
% 1.45/0.64 # Total time : 0.703 s
% 1.45/0.64 # Maximum resident set size: 1676 pages
% 1.45/0.64 % E---3.1 exiting
% 1.45/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------