TSTP Solution File: LCL229-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL229-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:16 EDT 2023
% Result : Unsatisfiable 22.36s 3.33s
% Output : CNFRefutation 22.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of clauses : 56 ( 30 unt; 0 nHn; 26 RR)
% Number of literals : 92 ( 2 equ; 41 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 118 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(p,implies(q,r)),implies(implies(p,implies(r,s)),implies(p,implies(q,s))))),
file('/export/starexec/sandbox/tmp/tmp.guhcotgxjL/E---3.1_21890.p',prove_this) ).
cnf(c_0_9,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_13,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_14,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_23,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_25,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_30,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X4))
| ~ axiom(or(X2,or(not(X4),X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_32,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( theorem(or(X1,or(not(X2),X2)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_34,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_36,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_37,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_39,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_40,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_41,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_42,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_43,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_44,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ theorem(implies(implies(p,implies(q,r)),implies(implies(p,implies(r,s)),implies(p,implies(q,s))))),
prove_this ).
cnf(c_0_46,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(or(X1,or(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_47,plain,
( theorem(or(or(not(or(not(X1),X2)),X3),X4))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X4,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_48,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_50,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X4)))
| ~ theorem(or(not(X2),or(X3,X4)))
| ~ theorem(or(X4,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_53,plain,
( theorem(or(X1,or(not(or(X2,X3)),or(X2,X4))))
| ~ theorem(or(X1,or(not(X3),X4))) ),
inference(spm,[status(thm)],[c_0_36,c_0_18]) ).
cnf(c_0_54,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(not(r),s)),or(not(q),s)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_24]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL229-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.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:10:48 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.guhcotgxjL/E---3.1_21890.p
% 22.36/3.33 # Version: 3.1pre001
% 22.36/3.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 22.36/3.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 22.36/3.33 # Starting new_bool_3 with 300s (1) cores
% 22.36/3.33 # Starting new_bool_1 with 300s (1) cores
% 22.36/3.33 # Starting sh5l with 300s (1) cores
% 22.36/3.33 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21991 completed with status 0
% 22.36/3.33 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 22.36/3.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 22.36/3.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 22.36/3.33 # No SInE strategy applied
% 22.36/3.33 # Search class: FHUNM-FFSF21-DFFFFFNN
% 22.36/3.33 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 22.36/3.33 # Starting new_bool_3 with 329s (1) cores
% 22.36/3.33 # Starting new_bool_1 with 324s (1) cores
% 22.36/3.33 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 22.36/3.33 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 21999 completed with status 0
% 22.36/3.33 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 22.36/3.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 22.36/3.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 22.36/3.33 # No SInE strategy applied
% 22.36/3.33 # Search class: FHUNM-FFSF21-DFFFFFNN
% 22.36/3.33 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 22.36/3.33 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 22.36/3.33 # Preprocessing time : 0.031 s
% 22.36/3.33
% 22.36/3.33 # Proof found!
% 22.36/3.33 # SZS status Unsatisfiable
% 22.36/3.33 # SZS output start CNFRefutation
% See solution above
% 22.36/3.33 # Parsed axioms : 9
% 22.36/3.33 # Removed by relevancy pruning/SinE : 0
% 22.36/3.33 # Initial clauses : 9
% 22.36/3.33 # Removed in clause preprocessing : 1
% 22.36/3.33 # Initial clauses in saturation : 8
% 22.36/3.33 # Processed clauses : 7229
% 22.36/3.33 # ...of these trivial : 23
% 22.36/3.33 # ...subsumed : 4633
% 22.36/3.33 # ...remaining for further processing : 2573
% 22.36/3.33 # Other redundant clauses eliminated : 0
% 22.36/3.33 # Clauses deleted for lack of memory : 0
% 22.36/3.33 # Backward-subsumed : 445
% 22.36/3.33 # Backward-rewritten : 8
% 22.36/3.33 # Generated clauses : 119048
% 22.36/3.33 # ...of the previous two non-redundant : 118057
% 22.36/3.33 # ...aggressively subsumed : 0
% 22.36/3.33 # Contextual simplify-reflections : 6
% 22.36/3.33 # Paramodulations : 119048
% 22.36/3.33 # Factorizations : 0
% 22.36/3.33 # NegExts : 0
% 22.36/3.33 # Equation resolutions : 0
% 22.36/3.33 # Total rewrite steps : 1121
% 22.36/3.33 # Propositional unsat checks : 0
% 22.36/3.33 # Propositional check models : 0
% 22.36/3.33 # Propositional check unsatisfiable : 0
% 22.36/3.33 # Propositional clauses : 0
% 22.36/3.33 # Propositional clauses after purity: 0
% 22.36/3.33 # Propositional unsat core size : 0
% 22.36/3.33 # Propositional preprocessing time : 0.000
% 22.36/3.33 # Propositional encoding time : 0.000
% 22.36/3.33 # Propositional solver time : 0.000
% 22.36/3.33 # Success case prop preproc time : 0.000
% 22.36/3.33 # Success case prop encoding time : 0.000
% 22.36/3.33 # Success case prop solver time : 0.000
% 22.36/3.33 # Current number of processed clauses : 2120
% 22.36/3.33 # Positive orientable unit clauses : 45
% 22.36/3.33 # Positive unorientable unit clauses: 0
% 22.36/3.33 # Negative unit clauses : 603
% 22.36/3.33 # Non-unit-clauses : 1472
% 22.36/3.33 # Current number of unprocessed clauses: 110542
% 22.36/3.33 # ...number of literals in the above : 420011
% 22.36/3.33 # Current number of archived formulas : 0
% 22.36/3.33 # Current number of archived clauses : 454
% 22.36/3.33 # Clause-clause subsumption calls (NU) : 569184
% 22.36/3.33 # Rec. Clause-clause subsumption calls : 382119
% 22.36/3.33 # Non-unit clause-clause subsumptions : 2197
% 22.36/3.33 # Unit Clause-clause subsumption calls : 85474
% 22.36/3.33 # Rewrite failures with RHS unbound : 0
% 22.36/3.33 # BW rewrite match attempts : 3570
% 22.36/3.33 # BW rewrite match successes : 8
% 22.36/3.33 # Condensation attempts : 0
% 22.36/3.33 # Condensation successes : 0
% 22.36/3.33 # Termbank termtop insertions : 2540077
% 22.36/3.33
% 22.36/3.33 # -------------------------------------------------
% 22.36/3.33 # User time : 2.623 s
% 22.36/3.33 # System time : 0.101 s
% 22.36/3.33 # Total time : 2.724 s
% 22.36/3.33 # Maximum resident set size: 1648 pages
% 22.36/3.33
% 22.36/3.33 # -------------------------------------------------
% 22.36/3.33 # User time : 13.528 s
% 22.36/3.33 # System time : 0.282 s
% 22.36/3.33 # Total time : 13.809 s
% 22.36/3.33 # Maximum resident set size: 1676 pages
% 22.36/3.33 % E---3.1 exiting
%------------------------------------------------------------------------------