TSTP Solution File: LCL253-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL253-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:23 EDT 2023
% Result : Unsatisfiable 27.07s 4.04s
% Output : CNFRefutation 27.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 13 unt; 0 nHn; 27 RR)
% Number of literals : 89 ( 0 equ; 44 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 117 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.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.mWFKQRe1i2/E---3.1_1099.p',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.p',axiom_1_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.mWFKQRe1i2/E---3.1_1099.p',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.p',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.p',axiom_1_4) ).
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.mWFKQRe1i2/E---3.1_1099.p',rule_3) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.p',rule_1) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
file('/export/starexec/sandbox/tmp/tmp.mWFKQRe1i2/E---3.1_1099.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(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_13,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_14,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_15,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
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_9,c_0_12]) ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_19,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_21,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_22,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3 ).
cnf(c_0_25,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_27,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( theorem(or(X1,or(or(X2,X3),X4)))
| ~ theorem(or(or(X1,X4),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_29,plain,
( theorem(or(not(or(X1,or(X2,X3))),X2))
| ~ theorem(or(not(or(X1,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_10]) ).
cnf(c_0_30,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(or(or(or(X1,X2),X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_31,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_32,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X3,X4)),X2))
| ~ axiom(or(not(X1),or(X3,or(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_33,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_34,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_35,plain,
( theorem(or(not(or(or(X1,X2),X3)),X1))
| ~ theorem(or(not(or(X3,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_37,plain,
( theorem(or(not(X1),or(X2,X3)))
| ~ axiom(or(X2,or(not(X4),X3)))
| ~ axiom(or(not(X1),X4)) ),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_38,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X3,X4)),X2))
| ~ axiom(or(not(X1),or(or(X2,X4),X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_39,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,or(X1,or(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_40,plain,
( theorem(or(not(X1),or(not(or(not(X2),X3)),or(X4,X3))))
| ~ axiom(or(not(X1),or(X4,X2))) ),
inference(spm,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_41,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X1,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_42,plain,
( theorem(or(not(or(not(X1),not(X2))),or(X3,not(X2))))
| ~ axiom(or(not(X2),or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( theorem(or(not(not(X1)),or(X2,not(X3))))
| ~ axiom(or(not(X3),or(X2,X1))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
prove_this ).
cnf(c_0_45,plain,
( theorem(or(X1,or(not(not(X2)),not(X3))))
| ~ axiom(or(not(X3),or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL253-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 12:32:21 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order model finding
% 0.22/0.48 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.mWFKQRe1i2/E---3.1_1099.p
% 27.07/4.04 # Version: 3.1pre001
% 27.07/4.04 # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.07/4.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.07/4.04 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.07/4.04 # Starting new_bool_3 with 300s (1) cores
% 27.07/4.04 # Starting new_bool_1 with 300s (1) cores
% 27.07/4.04 # Starting sh5l with 300s (1) cores
% 27.07/4.04 # sh5l with pid 1190 completed with status 0
% 27.07/4.04 # Result found by sh5l
% 27.07/4.04 # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.07/4.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.07/4.04 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.07/4.04 # Starting new_bool_3 with 300s (1) cores
% 27.07/4.04 # Starting new_bool_1 with 300s (1) cores
% 27.07/4.04 # Starting sh5l with 300s (1) cores
% 27.07/4.04 # SinE strategy is gf500_gu_R04_F100_L20000
% 27.07/4.04 # Search class: FHUNM-FFSF21-DFFFFFNN
% 27.07/4.04 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 27.07/4.04 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 71s (1) cores
% 27.07/4.04 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1201 completed with status 0
% 27.07/4.04 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 27.07/4.04 # Preprocessing class: FSMSSMSSSSSNFFN.
% 27.07/4.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.07/4.04 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.07/4.04 # Starting new_bool_3 with 300s (1) cores
% 27.07/4.04 # Starting new_bool_1 with 300s (1) cores
% 27.07/4.04 # Starting sh5l with 300s (1) cores
% 27.07/4.04 # SinE strategy is gf500_gu_R04_F100_L20000
% 27.07/4.04 # Search class: FHUNM-FFSF21-DFFFFFNN
% 27.07/4.04 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 27.07/4.04 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 71s (1) cores
% 27.07/4.04 # Preprocessing time : 0.029 s
% 27.07/4.04
% 27.07/4.04 # Proof found!
% 27.07/4.04 # SZS status Unsatisfiable
% 27.07/4.04 # SZS output start CNFRefutation
% See solution above
% 27.07/4.04 # Parsed axioms : 9
% 27.07/4.04 # Removed by relevancy pruning/SinE : 0
% 27.07/4.04 # Initial clauses : 9
% 27.07/4.04 # Removed in clause preprocessing : 0
% 27.07/4.04 # Initial clauses in saturation : 9
% 27.07/4.04 # Processed clauses : 13479
% 27.07/4.04 # ...of these trivial : 923
% 27.07/4.04 # ...subsumed : 8460
% 27.07/4.04 # ...remaining for further processing : 4096
% 27.07/4.04 # Other redundant clauses eliminated : 0
% 27.07/4.04 # Clauses deleted for lack of memory : 0
% 27.07/4.04 # Backward-subsumed : 68
% 27.07/4.04 # Backward-rewritten : 7
% 27.07/4.04 # Generated clauses : 196544
% 27.07/4.04 # ...of the previous two non-redundant : 171843
% 27.07/4.04 # ...aggressively subsumed : 0
% 27.07/4.04 # Contextual simplify-reflections : 0
% 27.07/4.04 # Paramodulations : 196544
% 27.07/4.04 # Factorizations : 0
% 27.07/4.04 # NegExts : 0
% 27.07/4.04 # Equation resolutions : 0
% 27.07/4.04 # Total rewrite steps : 25471
% 27.07/4.04 # Propositional unsat checks : 0
% 27.07/4.04 # Propositional check models : 0
% 27.07/4.04 # Propositional check unsatisfiable : 0
% 27.07/4.04 # Propositional clauses : 0
% 27.07/4.04 # Propositional clauses after purity: 0
% 27.07/4.04 # Propositional unsat core size : 0
% 27.07/4.04 # Propositional preprocessing time : 0.000
% 27.07/4.04 # Propositional encoding time : 0.000
% 27.07/4.04 # Propositional solver time : 0.000
% 27.07/4.04 # Success case prop preproc time : 0.000
% 27.07/4.04 # Success case prop encoding time : 0.000
% 27.07/4.04 # Success case prop solver time : 0.000
% 27.07/4.04 # Current number of processed clauses : 4021
% 27.07/4.04 # Positive orientable unit clauses : 683
% 27.07/4.04 # Positive unorientable unit clauses: 0
% 27.07/4.04 # Negative unit clauses : 64
% 27.07/4.04 # Non-unit-clauses : 3274
% 27.07/4.04 # Current number of unprocessed clauses: 158197
% 27.07/4.04 # ...number of literals in the above : 304620
% 27.07/4.04 # Current number of archived formulas : 0
% 27.07/4.04 # Current number of archived clauses : 75
% 27.07/4.04 # Clause-clause subsumption calls (NU) : 1843071
% 27.07/4.04 # Rec. Clause-clause subsumption calls : 1838910
% 27.07/4.04 # Non-unit clause-clause subsumptions : 8428
% 27.07/4.04 # Unit Clause-clause subsumption calls : 183622
% 27.07/4.04 # Rewrite failures with RHS unbound : 0
% 27.07/4.04 # BW rewrite match attempts : 233494
% 27.07/4.04 # BW rewrite match successes : 9
% 27.07/4.04 # Condensation attempts : 0
% 27.07/4.04 # Condensation successes : 0
% 27.07/4.04 # Termbank termtop insertions : 3737375
% 27.07/4.04
% 27.07/4.04 # -------------------------------------------------
% 27.07/4.04 # User time : 3.303 s
% 27.07/4.04 # System time : 0.126 s
% 27.07/4.04 # Total time : 3.429 s
% 27.07/4.04 # Maximum resident set size: 1688 pages
% 27.07/4.04
% 27.07/4.04 # -------------------------------------------------
% 27.07/4.04 # User time : 3.306 s
% 27.07/4.04 # System time : 0.127 s
% 27.07/4.04 # Total time : 3.433 s
% 27.07/4.04 # Maximum resident set size: 1684 pages
% 27.07/4.04 % E---3.1 exiting
%------------------------------------------------------------------------------