TSTP Solution File: LCL224-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL224-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:15 EDT 2023
% Result : Unsatisfiable 4.95s 1.10s
% Output : CNFRefutation 4.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 42 ( 15 unt; 0 nHn; 22 RR)
% Number of literals : 73 ( 0 equ; 34 neg)
% Maximal clause size : 3 ( 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 : 98 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',axiom_1_4) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',axiom_1_2) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',rule_3) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',axiom_1_6) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',rule_1) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
file('/export/starexec/sandbox/tmp/tmp.doskKgUT6B/E---3.1_1549.p',prove_this) ).
cnf(c_0_9,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_11,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_12,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_13,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_15,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_16,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,plain,
( theorem(or(X1,or(or(X2,X3),X4)))
| ~ theorem(or(or(X1,X4),X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3 ).
cnf(c_0_22,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_23,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(or(or(or(X1,X2),X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_26,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,plain,
( theorem(or(not(or(X1,or(X2,X3))),X4))
| ~ theorem(or(not(or(X2,or(X1,X3))),X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_28,plain,
( theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),X4)))
| ~ theorem(or(not(or(X3,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_31,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_32,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_33,negated_conjecture,
~ theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
prove_this ).
cnf(c_0_34,plain,
( theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X4,X2)),X5)))
| ~ theorem(or(not(or(X4,or(X1,X3))),X5)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_36,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ theorem(or(not(or(p,or(p,r))),or(p,r))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( theorem(or(not(or(X1,X2)),X2))
| ~ theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL224-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 12:32:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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.doskKgUT6B/E---3.1_1549.p
% 4.95/1.10 # Version: 3.1pre001
% 4.95/1.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.95/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.95/1.10 # Starting new_bool_3 with 300s (1) cores
% 4.95/1.10 # Starting new_bool_1 with 300s (1) cores
% 4.95/1.10 # Starting sh5l with 300s (1) cores
% 4.95/1.10 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1627 completed with status 0
% 4.95/1.10 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.95/1.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.95/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.95/1.10 # No SInE strategy applied
% 4.95/1.10 # Search class: FHUNM-FFSF21-MFFFFFNN
% 4.95/1.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.95/1.10 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 4.95/1.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.95/1.10 # Starting new_bool_3 with 136s (1) cores
% 4.95/1.10 # Starting new_bool_1 with 136s (1) cores
% 4.95/1.10 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 4.95/1.10 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 1639 completed with status 0
% 4.95/1.10 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 4.95/1.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.95/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.95/1.10 # No SInE strategy applied
% 4.95/1.10 # Search class: FHUNM-FFSF21-MFFFFFNN
% 4.95/1.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.95/1.10 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 4.95/1.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.95/1.10 # Starting new_bool_3 with 136s (1) cores
% 4.95/1.10 # Starting new_bool_1 with 136s (1) cores
% 4.95/1.10 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 4.95/1.10 # Preprocessing time : 0.001 s
% 4.95/1.10 # Presaturation interreduction done
% 4.95/1.10
% 4.95/1.10 # Proof found!
% 4.95/1.10 # SZS status Unsatisfiable
% 4.95/1.10 # SZS output start CNFRefutation
% See solution above
% 4.95/1.10 # Parsed axioms : 9
% 4.95/1.10 # Removed by relevancy pruning/SinE : 0
% 4.95/1.10 # Initial clauses : 9
% 4.95/1.10 # Removed in clause preprocessing : 0
% 4.95/1.10 # Initial clauses in saturation : 9
% 4.95/1.10 # Processed clauses : 7389
% 4.95/1.10 # ...of these trivial : 779
% 4.95/1.10 # ...subsumed : 4764
% 4.95/1.10 # ...remaining for further processing : 1846
% 4.95/1.10 # Other redundant clauses eliminated : 0
% 4.95/1.10 # Clauses deleted for lack of memory : 0
% 4.95/1.10 # Backward-subsumed : 62
% 4.95/1.10 # Backward-rewritten : 16
% 4.95/1.10 # Generated clauses : 53846
% 4.95/1.10 # ...of the previous two non-redundant : 46694
% 4.95/1.10 # ...aggressively subsumed : 0
% 4.95/1.10 # Contextual simplify-reflections : 0
% 4.95/1.10 # Paramodulations : 53846
% 4.95/1.10 # Factorizations : 0
% 4.95/1.10 # NegExts : 0
% 4.95/1.10 # Equation resolutions : 0
% 4.95/1.10 # Total rewrite steps : 7915
% 4.95/1.10 # Propositional unsat checks : 0
% 4.95/1.10 # Propositional check models : 0
% 4.95/1.10 # Propositional check unsatisfiable : 0
% 4.95/1.10 # Propositional clauses : 0
% 4.95/1.10 # Propositional clauses after purity: 0
% 4.95/1.10 # Propositional unsat core size : 0
% 4.95/1.10 # Propositional preprocessing time : 0.000
% 4.95/1.10 # Propositional encoding time : 0.000
% 4.95/1.10 # Propositional solver time : 0.000
% 4.95/1.10 # Success case prop preproc time : 0.000
% 4.95/1.10 # Success case prop encoding time : 0.000
% 4.95/1.10 # Success case prop solver time : 0.000
% 4.95/1.10 # Current number of processed clauses : 1759
% 4.95/1.10 # Positive orientable unit clauses : 670
% 4.95/1.10 # Positive unorientable unit clauses: 0
% 4.95/1.10 # Negative unit clauses : 125
% 4.95/1.10 # Non-unit-clauses : 964
% 4.95/1.10 # Current number of unprocessed clauses: 39247
% 4.95/1.10 # ...number of literals in the above : 56279
% 4.95/1.10 # Current number of archived formulas : 0
% 4.95/1.10 # Current number of archived clauses : 87
% 4.95/1.10 # Clause-clause subsumption calls (NU) : 367798
% 4.95/1.10 # Rec. Clause-clause subsumption calls : 367798
% 4.95/1.10 # Non-unit clause-clause subsumptions : 4538
% 4.95/1.10 # Unit Clause-clause subsumption calls : 21240
% 4.95/1.10 # Rewrite failures with RHS unbound : 0
% 4.95/1.10 # BW rewrite match attempts : 94903
% 4.95/1.10 # BW rewrite match successes : 6
% 4.95/1.10 # Condensation attempts : 0
% 4.95/1.10 # Condensation successes : 0
% 4.95/1.10 # Termbank termtop insertions : 738877
% 4.95/1.10
% 4.95/1.10 # -------------------------------------------------
% 4.95/1.10 # User time : 0.574 s
% 4.95/1.10 # System time : 0.036 s
% 4.95/1.10 # Total time : 0.610 s
% 4.95/1.10 # Maximum resident set size: 1596 pages
% 4.95/1.10
% 4.95/1.10 # -------------------------------------------------
% 4.95/1.10 # User time : 2.934 s
% 4.95/1.10 # System time : 0.095 s
% 4.95/1.10 # Total time : 3.030 s
% 4.95/1.10 # Maximum resident set size: 1680 pages
% 4.95/1.10 % E---3.1 exiting
%------------------------------------------------------------------------------