TSTP Solution File: LCL172-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL172-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:17:59 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
file('/export/starexec/sandbox/tmp/tmp.psfPJUYUAV/E---3.1_1932.p',prove_this) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.psfPJUYUAV/E---3.1_1932.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.psfPJUYUAV/E---3.1_1932.p',axiom_1_5) ).
cnf(c_0_3,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_4,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_5,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
c_0_3 ).
cnf(c_0_6,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_4 ).
cnf(c_0_7,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL172-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 08:32:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.psfPJUYUAV/E---3.1_1932.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 2033 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.50 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 2042 completed with status 0
% 0.20/0.50 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 9
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 9
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 9
% 0.20/0.50 # Processed clauses : 18
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 18
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 11
% 0.20/0.50 # ...of the previous two non-redundant : 10
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 11
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 9
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 10
% 0.20/0.50 # ...number of literals in the above : 20
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 9
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 10
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 10
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 12
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 509
% 0.20/0.50 # Search garbage collected termcells : 17
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.001 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1608 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1700 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------