TSTP Solution File: LCL208-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL208-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:11 EDT 2023
% Result : Unsatisfiable 0.15s 0.54s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of clauses : 44 ( 32 unt; 0 nHn; 15 RR)
% Number of literals : 60 ( 2 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 80 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',axiom_1_3) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.p',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(or(p,q),implies(not(p),q))),
file('/export/starexec/sandbox/tmp/tmp.1ei0fiKIEW/E---3.1_8020.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,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_16,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_19,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_23,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_27,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_28,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_29,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,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_27,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_33,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_34,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_36,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_34]) ).
cnf(c_0_37,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_38,plain,
theorem(or(or(not(or(X1,X2)),X2),not(not(X1)))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(implies(or(p,q),implies(not(p),q))),
prove_this ).
cnf(c_0_40,plain,
theorem(or(not(not(X1)),or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(not(p)),q))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_10]),c_0_10]) ).
cnf(c_0_42,plain,
theorem(or(not(or(X1,X2)),or(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL208-3 : TPTP v8.1.2. Released v2.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 12:10:21 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.1ei0fiKIEW/E---3.1_8020.p
% 0.15/0.54 # Version: 3.1pre001
% 0.15/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.54 # Starting sh5l with 300s (1) cores
% 0.15/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8097 completed with status 0
% 0.15/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.54 # No SInE strategy applied
% 0.15/0.54 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.54 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.54 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/0.54 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 8102 completed with status 0
% 0.15/0.54 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.15/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.54 # No SInE strategy applied
% 0.15/0.54 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.15/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.54 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.15/0.54 # Preprocessing time : 0.001 s
% 0.15/0.54 # Presaturation interreduction done
% 0.15/0.54
% 0.15/0.54 # Proof found!
% 0.15/0.54 # SZS status Unsatisfiable
% 0.15/0.54 # SZS output start CNFRefutation
% See solution above
% 0.15/0.54 # Parsed axioms : 9
% 0.15/0.54 # Removed by relevancy pruning/SinE : 0
% 0.15/0.54 # Initial clauses : 9
% 0.15/0.54 # Removed in clause preprocessing : 1
% 0.15/0.54 # Initial clauses in saturation : 8
% 0.15/0.54 # Processed clauses : 1917
% 0.15/0.54 # ...of these trivial : 178
% 0.15/0.54 # ...subsumed : 1048
% 0.15/0.54 # ...remaining for further processing : 691
% 0.15/0.54 # Other redundant clauses eliminated : 0
% 0.15/0.54 # Clauses deleted for lack of memory : 0
% 0.15/0.54 # Backward-subsumed : 2
% 0.15/0.54 # Backward-rewritten : 2
% 0.15/0.54 # Generated clauses : 8978
% 0.15/0.54 # ...of the previous two non-redundant : 5960
% 0.15/0.54 # ...aggressively subsumed : 0
% 0.15/0.54 # Contextual simplify-reflections : 0
% 0.15/0.54 # Paramodulations : 8978
% 0.15/0.54 # Factorizations : 0
% 0.15/0.54 # NegExts : 0
% 0.15/0.54 # Equation resolutions : 0
% 0.15/0.54 # Total rewrite steps : 3129
% 0.15/0.54 # Propositional unsat checks : 0
% 0.15/0.54 # Propositional check models : 0
% 0.15/0.54 # Propositional check unsatisfiable : 0
% 0.15/0.54 # Propositional clauses : 0
% 0.15/0.54 # Propositional clauses after purity: 0
% 0.15/0.54 # Propositional unsat core size : 0
% 0.15/0.54 # Propositional preprocessing time : 0.000
% 0.15/0.54 # Propositional encoding time : 0.000
% 0.15/0.54 # Propositional solver time : 0.000
% 0.15/0.54 # Success case prop preproc time : 0.000
% 0.15/0.54 # Success case prop encoding time : 0.000
% 0.15/0.54 # Success case prop solver time : 0.000
% 0.15/0.54 # Current number of processed clauses : 679
% 0.15/0.54 # Positive orientable unit clauses : 397
% 0.15/0.54 # Positive unorientable unit clauses: 0
% 0.15/0.54 # Negative unit clauses : 11
% 0.15/0.54 # Non-unit-clauses : 271
% 0.15/0.54 # Current number of unprocessed clauses: 4055
% 0.15/0.54 # ...number of literals in the above : 4863
% 0.15/0.54 # Current number of archived formulas : 0
% 0.15/0.54 # Current number of archived clauses : 13
% 0.15/0.54 # Clause-clause subsumption calls (NU) : 12543
% 0.15/0.54 # Rec. Clause-clause subsumption calls : 12543
% 0.15/0.54 # Non-unit clause-clause subsumptions : 1046
% 0.15/0.54 # Unit Clause-clause subsumption calls : 434
% 0.15/0.54 # Rewrite failures with RHS unbound : 0
% 0.15/0.54 # BW rewrite match attempts : 21387
% 0.15/0.54 # BW rewrite match successes : 2
% 0.15/0.54 # Condensation attempts : 0
% 0.15/0.54 # Condensation successes : 0
% 0.15/0.54 # Termbank termtop insertions : 105022
% 0.15/0.54
% 0.15/0.54 # -------------------------------------------------
% 0.15/0.54 # User time : 0.106 s
% 0.15/0.54 # System time : 0.004 s
% 0.15/0.54 # Total time : 0.110 s
% 0.15/0.54 # Maximum resident set size: 1652 pages
% 0.15/0.54
% 0.15/0.54 # -------------------------------------------------
% 0.15/0.54 # User time : 0.532 s
% 0.15/0.54 # System time : 0.015 s
% 0.15/0.54 # Total time : 0.548 s
% 0.15/0.54 # Maximum resident set size: 1680 pages
% 0.15/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------