TSTP Solution File: LCL237-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL237-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 08:18:19 EDT 2024
% Result : Unsatisfiable 1.45s 0.59s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 36 ( 23 unt; 0 nHn; 17 RR)
% Number of literals : 54 ( 4 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p',and_defn) ).
cnf(c_0_8,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_11 ).
cnf(c_0_14,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_19,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_21,plain,
theorem(or(or(X1,X2),not(or(X2,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_23,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_27,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X1,or(X3,X2)))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
c_0_26 ).
cnf(c_0_30,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_31,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_32,plain,
theorem(or(X1,or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_10]),c_0_10]),c_0_30]) ).
cnf(c_0_34,plain,
theorem(or(X1,or(X2,not(or(X2,X1))))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : LCL237-3 : TPTP v8.1.2. Released v2.3.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n006.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 08:57:04 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.nF9B232TH4/E---3.1_7337.p
% 1.45/0.59 # Version: 3.1.0
% 1.45/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.59 # Starting new_bool_3 with 300s (1) cores
% 1.45/0.59 # Starting new_bool_1 with 300s (1) cores
% 1.45/0.59 # Starting sh5l with 300s (1) cores
% 1.45/0.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7416 completed with status 0
% 1.45/0.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.45/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.59 # No SInE strategy applied
% 1.45/0.59 # Search class: FHUNM-FFSF21-MFFFFFNN
% 1.45/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.59 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 1.45/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.45/0.59 # Starting new_bool_3 with 136s (1) cores
% 1.45/0.59 # Starting new_bool_1 with 136s (1) cores
% 1.45/0.59 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 1.45/0.59 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 7420 completed with status 0
% 1.45/0.59 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 1.45/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.45/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.45/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.45/0.59 # No SInE strategy applied
% 1.45/0.59 # Search class: FHUNM-FFSF21-MFFFFFNN
% 1.45/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.45/0.59 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 1.45/0.59 # Preprocessing time : 0.001 s
% 1.45/0.59 # Presaturation interreduction done
% 1.45/0.59
% 1.45/0.59 # Proof found!
% 1.45/0.59 # SZS status Unsatisfiable
% 1.45/0.59 # SZS output start CNFRefutation
% See solution above
% 1.45/0.59 # Parsed axioms : 10
% 1.45/0.59 # Removed by relevancy pruning/SinE : 0
% 1.45/0.59 # Initial clauses : 10
% 1.45/0.59 # Removed in clause preprocessing : 2
% 1.45/0.59 # Initial clauses in saturation : 8
% 1.45/0.59 # Processed clauses : 3154
% 1.45/0.59 # ...of these trivial : 253
% 1.45/0.59 # ...subsumed : 1997
% 1.45/0.59 # ...remaining for further processing : 904
% 1.45/0.59 # Other redundant clauses eliminated : 0
% 1.45/0.59 # Clauses deleted for lack of memory : 0
% 1.45/0.59 # Backward-subsumed : 7
% 1.45/0.59 # Backward-rewritten : 2
% 1.45/0.59 # Generated clauses : 18029
% 1.45/0.59 # ...of the previous two non-redundant : 11803
% 1.45/0.59 # ...aggressively subsumed : 0
% 1.45/0.59 # Contextual simplify-reflections : 0
% 1.45/0.59 # Paramodulations : 18029
% 1.45/0.59 # Factorizations : 0
% 1.45/0.59 # NegExts : 0
% 1.45/0.59 # Equation resolutions : 0
% 1.45/0.59 # Disequality decompositions : 0
% 1.45/0.59 # Total rewrite steps : 6366
% 1.45/0.59 # ...of those cached : 5492
% 1.45/0.59 # Propositional unsat checks : 0
% 1.45/0.59 # Propositional check models : 0
% 1.45/0.59 # Propositional check unsatisfiable : 0
% 1.45/0.59 # Propositional clauses : 0
% 1.45/0.59 # Propositional clauses after purity: 0
% 1.45/0.59 # Propositional unsat core size : 0
% 1.45/0.59 # Propositional preprocessing time : 0.000
% 1.45/0.59 # Propositional encoding time : 0.000
% 1.45/0.59 # Propositional solver time : 0.000
% 1.45/0.59 # Success case prop preproc time : 0.000
% 1.45/0.59 # Success case prop encoding time : 0.000
% 1.45/0.59 # Success case prop solver time : 0.000
% 1.45/0.59 # Current number of processed clauses : 887
% 1.45/0.59 # Positive orientable unit clauses : 520
% 1.45/0.59 # Positive unorientable unit clauses: 0
% 1.45/0.59 # Negative unit clauses : 13
% 1.45/0.59 # Non-unit-clauses : 354
% 1.45/0.59 # Current number of unprocessed clauses: 8658
% 1.45/0.59 # ...number of literals in the above : 10755
% 1.45/0.59 # Current number of archived formulas : 0
% 1.45/0.59 # Current number of archived clauses : 19
% 1.45/0.59 # Clause-clause subsumption calls (NU) : 23206
% 1.45/0.59 # Rec. Clause-clause subsumption calls : 23206
% 1.45/0.59 # Non-unit clause-clause subsumptions : 2001
% 1.45/0.59 # Unit Clause-clause subsumption calls : 1148
% 1.45/0.59 # Rewrite failures with RHS unbound : 0
% 1.45/0.59 # BW rewrite match attempts : 34601
% 1.45/0.59 # BW rewrite match successes : 2
% 1.45/0.59 # Condensation attempts : 0
% 1.45/0.59 # Condensation successes : 0
% 1.45/0.59 # Termbank termtop insertions : 204681
% 1.45/0.59 # Search garbage collected termcells : 11
% 1.45/0.59
% 1.45/0.59 # -------------------------------------------------
% 1.45/0.59 # User time : 0.162 s
% 1.45/0.59 # System time : 0.007 s
% 1.45/0.59 # Total time : 0.169 s
% 1.45/0.59 # Maximum resident set size: 1648 pages
% 1.45/0.59
% 1.45/0.59 # -------------------------------------------------
% 1.45/0.59 # User time : 0.854 s
% 1.45/0.59 # System time : 0.023 s
% 1.45/0.59 # Total time : 0.877 s
% 1.45/0.59 # Maximum resident set size: 1696 pages
% 1.45/0.59 % E---3.1 exiting
% 1.45/0.59 % E exiting
%------------------------------------------------------------------------------