TSTP Solution File: LCL186-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL186-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:04 EDT 2023
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 16 unt; 0 nHn; 10 RR)
% Number of literals : 36 ( 2 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',axiom_1_6) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',implies_definition) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(p),implies(p,q))),
file('/export/starexec/sandbox2/tmp/tmp.u5ZittLqrV/E---3.1_8494.p',prove_this) ).
cnf(c_0_7,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_8,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_9,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_10,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( theorem(implies(or(X1,X2),or(X1,X3)))
| ~ theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_16,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
theorem(implies(or(X1,X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_19,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ theorem(implies(not(p),implies(p,q))),
prove_this ).
cnf(c_0_22,plain,
theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : LCL186-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n012.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.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Oct 2 11:43:05 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.u5ZittLqrV/E---3.1_8494.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 8575 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.42 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 8578 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.42 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 9
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 9
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 9
% 0.15/0.42 # Processed clauses : 122
% 0.15/0.42 # ...of these trivial : 7
% 0.15/0.42 # ...subsumed : 43
% 0.15/0.42 # ...remaining for further processing : 72
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 1
% 0.15/0.42 # Generated clauses : 212
% 0.15/0.42 # ...of the previous two non-redundant : 192
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 212
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 36
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 62
% 0.15/0.42 # Positive orientable unit clauses : 28
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 3
% 0.15/0.42 # Non-unit-clauses : 31
% 0.15/0.42 # Current number of unprocessed clauses: 88
% 0.15/0.42 # ...number of literals in the above : 152
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 10
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 330
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 303
% 0.15/0.42 # Non-unit clause-clause subsumptions : 43
% 0.15/0.42 # Unit Clause-clause subsumption calls : 23
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 51
% 0.15/0.42 # BW rewrite match successes : 1
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 2622
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.007 s
% 0.15/0.42 # Maximum resident set size: 1652 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.005 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1684 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------