TSTP Solution File: LCL239-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL239-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 27 unt; 0 nHn; 14 RR)
% Number of literals : 53 ( 4 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 62 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',axiom_1_4) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',axiom_1_6) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(not(and(p,not(p)))),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.MjjBsejH0o/E---3.1_8434.p',and_defn) ).
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(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_18,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
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(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_21,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_18,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_22,plain,
theorem(or(X1,not(or(X1,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_24,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_26,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_27,plain,
theorem(or(not(or(X1,or(X2,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_30,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ theorem(not(and(p,not(p)))),
prove_this ).
cnf(c_0_33,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_34,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(not(not(or(not(p),not(not(p)))))),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL239-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.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 13:04:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.MjjBsejH0o/E---3.1_8434.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8527 completed with status 0
% 0.20/0.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.20/0.49 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 8533 completed with status 0
% 0.20/0.49 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 10
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 10
% 0.20/0.49 # Removed in clause preprocessing : 2
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 48
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 7
% 0.20/0.49 # ...remaining for further processing : 41
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 61
% 0.20/0.49 # ...of the previous two non-redundant : 49
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 61
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 8
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 33
% 0.20/0.49 # Positive orientable unit clauses : 14
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 17
% 0.20/0.49 # Current number of unprocessed clauses: 16
% 0.20/0.49 # ...number of literals in the above : 22
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 55
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 55
% 0.20/0.49 # Non-unit clause-clause subsumptions : 7
% 0.20/0.49 # Unit Clause-clause subsumption calls : 10
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 34
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1050
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1652 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.020 s
% 0.20/0.49 # System time : 0.009 s
% 0.20/0.49 # Total time : 0.029 s
% 0.20/0.49 # Maximum resident set size: 1680 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------