TSTP Solution File: LCL190-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL190-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:24:05 EDT 2023
% Result : Unsatisfiable 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p',rule_2) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
file('/export/starexec/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p',prove_this) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p',axiom_1_4) ).
cnf(c_0_5,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_7,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
prove_this ).
cnf(c_0_8,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ theorem(or(not(or(q,r)),or(r,q))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_11,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n019.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 2400
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Mon Oct 2 12:41:51 EDT 2023
% 0.08/0.26 % CPUTime :
% 0.11/0.34 Running first-order model finding
% 0.11/0.34 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.BUlxJTl6X5/E---3.1_30672.p
% 0.11/0.34 # Version: 3.1pre001
% 0.11/0.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.34 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.34 # Starting sh5l with 300s (1) cores
% 0.11/0.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30749 completed with status 0
% 0.11/0.34 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.34 # No SInE strategy applied
% 0.11/0.34 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.34 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.34 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.11/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.34 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.34 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.35 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.11/0.35 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 30760 completed with status 0
% 0.11/0.35 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.11/0.35 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.35 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.11/0.35 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.35 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.35 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.35 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.11/0.35 # Preprocessing time : 0.001 s
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35
% 0.11/0.35 # Proof found!
% 0.11/0.35 # SZS status Unsatisfiable
% 0.11/0.35 # SZS output start CNFRefutation
% See solution above
% 0.11/0.35 # Parsed axioms : 9
% 0.11/0.35 # Removed by relevancy pruning/SinE : 0
% 0.11/0.35 # Initial clauses : 9
% 0.11/0.35 # Removed in clause preprocessing : 0
% 0.11/0.35 # Initial clauses in saturation : 9
% 0.11/0.35 # Processed clauses : 52
% 0.11/0.35 # ...of these trivial : 0
% 0.11/0.35 # ...subsumed : 7
% 0.11/0.35 # ...remaining for further processing : 45
% 0.11/0.35 # Other redundant clauses eliminated : 0
% 0.11/0.35 # Clauses deleted for lack of memory : 0
% 0.11/0.35 # Backward-subsumed : 0
% 0.11/0.35 # Backward-rewritten : 0
% 0.11/0.35 # Generated clauses : 54
% 0.11/0.35 # ...of the previous two non-redundant : 47
% 0.11/0.35 # ...aggressively subsumed : 0
% 0.11/0.35 # Contextual simplify-reflections : 0
% 0.11/0.35 # Paramodulations : 54
% 0.11/0.35 # Factorizations : 0
% 0.11/0.35 # NegExts : 0
% 0.11/0.35 # Equation resolutions : 0
% 0.11/0.35 # Total rewrite steps : 1
% 0.11/0.35 # Propositional unsat checks : 0
% 0.11/0.35 # Propositional check models : 0
% 0.11/0.35 # Propositional check unsatisfiable : 0
% 0.11/0.35 # Propositional clauses : 0
% 0.11/0.35 # Propositional clauses after purity: 0
% 0.11/0.35 # Propositional unsat core size : 0
% 0.11/0.35 # Propositional preprocessing time : 0.000
% 0.11/0.35 # Propositional encoding time : 0.000
% 0.11/0.35 # Propositional solver time : 0.000
% 0.11/0.35 # Success case prop preproc time : 0.000
% 0.11/0.35 # Success case prop encoding time : 0.000
% 0.11/0.35 # Success case prop solver time : 0.000
% 0.11/0.35 # Current number of processed clauses : 36
% 0.11/0.35 # Positive orientable unit clauses : 5
% 0.11/0.35 # Positive unorientable unit clauses: 0
% 0.11/0.35 # Negative unit clauses : 18
% 0.11/0.35 # Non-unit-clauses : 13
% 0.11/0.35 # Current number of unprocessed clauses: 13
% 0.11/0.35 # ...number of literals in the above : 26
% 0.11/0.35 # Current number of archived formulas : 0
% 0.11/0.35 # Current number of archived clauses : 9
% 0.11/0.35 # Clause-clause subsumption calls (NU) : 57
% 0.11/0.35 # Rec. Clause-clause subsumption calls : 57
% 0.11/0.35 # Non-unit clause-clause subsumptions : 5
% 0.11/0.35 # Unit Clause-clause subsumption calls : 30
% 0.11/0.35 # Rewrite failures with RHS unbound : 0
% 0.11/0.35 # BW rewrite match attempts : 20
% 0.11/0.35 # BW rewrite match successes : 0
% 0.11/0.35 # Condensation attempts : 0
% 0.11/0.35 # Condensation successes : 0
% 0.11/0.35 # Termbank termtop insertions : 796
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.002 s
% 0.11/0.35 # System time : 0.002 s
% 0.11/0.35 # Total time : 0.004 s
% 0.11/0.35 # Maximum resident set size: 1648 pages
% 0.11/0.35
% 0.11/0.35 # -------------------------------------------------
% 0.11/0.35 # User time : 0.012 s
% 0.11/0.35 # System time : 0.006 s
% 0.11/0.35 # Total time : 0.017 s
% 0.11/0.35 # Maximum resident set size: 1684 pages
% 0.11/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------