TSTP Solution File: LCL237-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n023.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:26:58 EDT 2024
% Result : Unsatisfiable 1.94s 0.72s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 18 unt; 0 nHn; 19 RR)
% Number of literals : 55 ( 4 equ; 26 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 : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.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.ioCrGwKP2u/E---3.1_23878.p',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.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(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
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(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_14,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_17,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_19,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_22,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_23,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
c_0_22 ).
cnf(c_0_27,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_28,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_30,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_26,c_0_10]),c_0_10]),c_0_27]) ).
cnf(c_0_31,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X3,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL237-3 : TPTP v8.1.2. Released v2.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:17:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ioCrGwKP2u/E---3.1_23878.p
% 1.94/0.72 # Version: 3.1.0
% 1.94/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.94/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.94/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.94/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.94/0.72 # Starting sh5l with 300s (1) cores
% 1.94/0.72 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23963 completed with status 0
% 1.94/0.72 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.94/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.94/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.94/0.72 # No SInE strategy applied
% 1.94/0.72 # Search class: FHUNM-FFSF21-MFFFFFNN
% 1.94/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.94/0.72 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 1.94/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.94/0.72 # Starting new_bool_3 with 136s (1) cores
% 1.94/0.72 # Starting new_bool_1 with 136s (1) cores
% 1.94/0.72 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 1.94/0.72 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23970 completed with status 0
% 1.94/0.72 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.94/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.94/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.94/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.94/0.72 # No SInE strategy applied
% 1.94/0.72 # Search class: FHUNM-FFSF21-MFFFFFNN
% 1.94/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.94/0.72 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 1.94/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.94/0.72 # Preprocessing time : 0.006 s
% 1.94/0.72
% 1.94/0.72 # Proof found!
% 1.94/0.72 # SZS status Unsatisfiable
% 1.94/0.72 # SZS output start CNFRefutation
% See solution above
% 1.94/0.72 # Parsed axioms : 10
% 1.94/0.72 # Removed by relevancy pruning/SinE : 0
% 1.94/0.72 # Initial clauses : 10
% 1.94/0.72 # Removed in clause preprocessing : 2
% 1.94/0.72 # Initial clauses in saturation : 8
% 1.94/0.72 # Processed clauses : 1200
% 1.94/0.72 # ...of these trivial : 8
% 1.94/0.72 # ...subsumed : 759
% 1.94/0.72 # ...remaining for further processing : 433
% 1.94/0.72 # Other redundant clauses eliminated : 0
% 1.94/0.72 # Clauses deleted for lack of memory : 0
% 1.94/0.72 # Backward-subsumed : 5
% 1.94/0.72 # Backward-rewritten : 0
% 1.94/0.72 # Generated clauses : 8768
% 1.94/0.72 # ...of the previous two non-redundant : 8450
% 1.94/0.72 # ...aggressively subsumed : 0
% 1.94/0.72 # Contextual simplify-reflections : 0
% 1.94/0.72 # Paramodulations : 8768
% 1.94/0.72 # Factorizations : 0
% 1.94/0.72 # NegExts : 0
% 1.94/0.72 # Equation resolutions : 0
% 1.94/0.72 # Disequality decompositions : 0
% 1.94/0.72 # Total rewrite steps : 174
% 1.94/0.72 # ...of those cached : 142
% 1.94/0.72 # Propositional unsat checks : 0
% 1.94/0.72 # Propositional check models : 0
% 1.94/0.72 # Propositional check unsatisfiable : 0
% 1.94/0.72 # Propositional clauses : 0
% 1.94/0.72 # Propositional clauses after purity: 0
% 1.94/0.72 # Propositional unsat core size : 0
% 1.94/0.72 # Propositional preprocessing time : 0.000
% 1.94/0.72 # Propositional encoding time : 0.000
% 1.94/0.72 # Propositional solver time : 0.000
% 1.94/0.72 # Success case prop preproc time : 0.000
% 1.94/0.72 # Success case prop encoding time : 0.000
% 1.94/0.72 # Success case prop solver time : 0.000
% 1.94/0.72 # Current number of processed clauses : 428
% 1.94/0.72 # Positive orientable unit clauses : 26
% 1.94/0.72 # Positive unorientable unit clauses: 0
% 1.94/0.72 # Negative unit clauses : 29
% 1.94/0.72 # Non-unit-clauses : 373
% 1.94/0.72 # Current number of unprocessed clauses: 7180
% 1.94/0.72 # ...number of literals in the above : 22191
% 1.94/0.72 # Current number of archived formulas : 0
% 1.94/0.72 # Current number of archived clauses : 7
% 1.94/0.72 # Clause-clause subsumption calls (NU) : 28116
% 1.94/0.72 # Rec. Clause-clause subsumption calls : 24794
% 1.94/0.72 # Non-unit clause-clause subsumptions : 747
% 1.94/0.72 # Unit Clause-clause subsumption calls : 583
% 1.94/0.72 # Rewrite failures with RHS unbound : 0
% 1.94/0.72 # BW rewrite match attempts : 500
% 1.94/0.72 # BW rewrite match successes : 2
% 1.94/0.72 # Condensation attempts : 0
% 1.94/0.72 # Condensation successes : 0
% 1.94/0.72 # Termbank termtop insertions : 137076
% 1.94/0.72 # Search garbage collected termcells : 11
% 1.94/0.72
% 1.94/0.72 # -------------------------------------------------
% 1.94/0.72 # User time : 0.185 s
% 1.94/0.72 # System time : 0.009 s
% 1.94/0.72 # Total time : 0.194 s
% 1.94/0.72 # Maximum resident set size: 1648 pages
% 1.94/0.72
% 1.94/0.72 # -------------------------------------------------
% 1.94/0.72 # User time : 0.987 s
% 1.94/0.72 # System time : 0.030 s
% 1.94/0.72 # Total time : 1.017 s
% 1.94/0.72 # Maximum resident set size: 1696 pages
% 1.94/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------