TSTP Solution File: LCL268-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.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:26 EDT 2023
% Result : Unsatisfiable 136.29s 136.56s
% Output : CNFRefutation 136.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 26 unt; 0 nHn; 16 RR)
% Number of literals : 52 ( 7 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 63 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',axiom_1_4) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',implies_definition) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',axiom_1_2) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',and_defn) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',axiom_1_3) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(p,p)),
file('/export/starexec/sandbox2/tmp/tmp.SDpeeybBYd/E---3.1_31890.p',prove_this) ).
cnf(c_0_10,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_11,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_12,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_13,plain,
theorem(implies(or(X1,X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_16,plain,
( theorem(or(X1,not(X2)))
| ~ theorem(implies(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,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_19,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_20,plain,
( theorem(implies(X1,not(X2)))
| ~ theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,plain,
theorem(implies(or(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_23,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,plain,
theorem(implies(X1,and(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]),c_0_22]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_26,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_27,plain,
( theorem(and(X1,X1))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_28,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_29,plain,
( theorem(or(X1,implies(X2,X3)))
| ~ theorem(implies(X2,or(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_15]) ).
cnf(c_0_30,plain,
theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ theorem(equivalent(p,p)),
prove_this ).
cnf(c_0_32,plain,
( theorem(equivalent(X1,X1))
| ~ theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_34,plain,
theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(implies(p,p)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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:31:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 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.SDpeeybBYd/E---3.1_31890.p
% 136.29/136.56 # Version: 3.1pre001
% 136.29/136.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.29/136.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.29/136.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.29/136.56 # Starting new_bool_3 with 300s (1) cores
% 136.29/136.56 # Starting new_bool_1 with 300s (1) cores
% 136.29/136.56 # Starting sh5l with 300s (1) cores
% 136.29/136.56 # new_bool_1 with pid 31970 completed with status 0
% 136.29/136.56 # Result found by new_bool_1
% 136.29/136.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.29/136.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.29/136.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.29/136.56 # Starting new_bool_3 with 300s (1) cores
% 136.29/136.56 # Starting new_bool_1 with 300s (1) cores
% 136.29/136.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.29/136.56 # Search class: FHUSM-FFSF21-MFFFFFNN
% 136.29/136.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 136.29/136.56 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 136.29/136.56 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 31972 completed with status 0
% 136.29/136.56 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 136.29/136.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.29/136.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.29/136.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.29/136.56 # Starting new_bool_3 with 300s (1) cores
% 136.29/136.56 # Starting new_bool_1 with 300s (1) cores
% 136.29/136.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.29/136.56 # Search class: FHUSM-FFSF21-MFFFFFNN
% 136.29/136.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 136.29/136.56 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 136.29/136.56 # Preprocessing time : 0.001 s
% 136.29/136.56 # Presaturation interreduction done
% 136.29/136.56
% 136.29/136.56 # Proof found!
% 136.29/136.56 # SZS status Unsatisfiable
% 136.29/136.56 # SZS output start CNFRefutation
% See solution above
% 136.29/136.56 # Parsed axioms : 11
% 136.29/136.56 # Removed by relevancy pruning/SinE : 0
% 136.29/136.56 # Initial clauses : 11
% 136.29/136.56 # Removed in clause preprocessing : 0
% 136.29/136.56 # Initial clauses in saturation : 11
% 136.29/136.56 # Processed clauses : 153
% 136.29/136.56 # ...of these trivial : 4
% 136.29/136.56 # ...subsumed : 50
% 136.29/136.56 # ...remaining for further processing : 99
% 136.29/136.56 # Other redundant clauses eliminated : 0
% 136.29/136.56 # Clauses deleted for lack of memory : 0
% 136.29/136.56 # Backward-subsumed : 0
% 136.29/136.56 # Backward-rewritten : 3
% 136.29/136.56 # Generated clauses : 298
% 136.29/136.56 # ...of the previous two non-redundant : 252
% 136.29/136.56 # ...aggressively subsumed : 0
% 136.29/136.56 # Contextual simplify-reflections : 0
% 136.29/136.56 # Paramodulations : 298
% 136.29/136.56 # Factorizations : 0
% 136.29/136.56 # NegExts : 0
% 136.29/136.56 # Equation resolutions : 0
% 136.29/136.56 # Total rewrite steps : 153
% 136.29/136.56 # Propositional unsat checks : 0
% 136.29/136.56 # Propositional check models : 0
% 136.29/136.56 # Propositional check unsatisfiable : 0
% 136.29/136.56 # Propositional clauses : 0
% 136.29/136.56 # Propositional clauses after purity: 0
% 136.29/136.56 # Propositional unsat core size : 0
% 136.29/136.56 # Propositional preprocessing time : 0.000
% 136.29/136.56 # Propositional encoding time : 0.000
% 136.29/136.56 # Propositional solver time : 0.000
% 136.29/136.56 # Success case prop preproc time : 0.000
% 136.29/136.56 # Success case prop encoding time : 0.000
% 136.29/136.56 # Success case prop solver time : 0.000
% 136.29/136.56 # Current number of processed clauses : 85
% 136.29/136.56 # Positive orientable unit clauses : 33
% 136.29/136.56 # Positive unorientable unit clauses: 0
% 136.29/136.56 # Negative unit clauses : 2
% 136.29/136.56 # Non-unit-clauses : 50
% 136.29/136.56 # Current number of unprocessed clauses: 120
% 136.29/136.56 # ...number of literals in the above : 222
% 136.29/136.56 # Current number of archived formulas : 0
% 136.29/136.56 # Current number of archived clauses : 14
% 136.29/136.56 # Clause-clause subsumption calls (NU) : 1006
% 136.29/136.56 # Rec. Clause-clause subsumption calls : 847
% 136.29/136.56 # Non-unit clause-clause subsumptions : 50
% 136.29/136.56 # Unit Clause-clause subsumption calls : 14
% 136.29/136.56 # Rewrite failures with RHS unbound : 0
% 136.29/136.56 # BW rewrite match attempts : 35
% 136.29/136.56 # BW rewrite match successes : 3
% 136.29/136.56 # Condensation attempts : 0
% 136.29/136.56 # Condensation successes : 0
% 136.29/136.56 # Termbank termtop insertions : 4323
% 136.29/136.56
% 136.29/136.56 # -------------------------------------------------
% 136.29/136.56 # User time : 0.008 s
% 136.29/136.56 # System time : 0.002 s
% 136.29/136.56 # Total time : 0.010 s
% 136.29/136.56 # Maximum resident set size: 1648 pages
% 136.29/136.56
% 136.29/136.56 # -------------------------------------------------
% 136.29/136.56 # User time : 0.009 s
% 136.29/136.56 # System time : 0.004 s
% 136.29/136.56 # Total time : 0.013 s
% 136.29/136.56 # Maximum resident set size: 1680 pages
% 136.29/136.56 % E---3.1 exiting
%------------------------------------------------------------------------------