TSTP Solution File: LCL203-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:11:58 EDT 2023
% Result : Unsatisfiable 0.11s 0.38s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 46 ( 27 unt; 0 nHn; 21 RR)
% Number of literals : 70 ( 2 equ; 28 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 : 86 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',axiom_1_3) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(or(p,q)),or(not(p),not(q)))),
file('/export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.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(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,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_17,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_18,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_19,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
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(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
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_15,c_0_18]) ).
cnf(c_0_24,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_26,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_21,c_0_10]),c_0_10]),c_0_10]) ).
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,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_30,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_32,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_35,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_37,negated_conjecture,
~ theorem(implies(not(or(p,q)),or(not(p),not(q)))),
prove_this ).
cnf(c_0_38,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_40,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
inference(rw,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_41,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_42,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_44,plain,
theorem(or(not(not(or(X1,X2))),not(X2))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n019.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 2400
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Mon Oct 2 12:42:06 EDT 2023
% 0.08/0.26 % CPUTime :
% 0.11/0.34 Running first-order theorem proving
% 0.11/0.34 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.UtEuiykCq2/E---3.1_31355.p
% 0.11/0.38 # Version: 3.1pre001
% 0.11/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.38 # Starting sh5l with 300s (1) cores
% 0.11/0.38 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31433 completed with status 0
% 0.11/0.38 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.38 # No SInE strategy applied
% 0.11/0.38 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.38 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.11/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.38 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.38 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.38 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.11/0.38 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 31444 completed with status 0
% 0.11/0.38 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.11/0.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.38 # No SInE strategy applied
% 0.11/0.38 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.11/0.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.38 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.11/0.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.38 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.38 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.38 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.11/0.38 # Preprocessing time : 0.001 s
% 0.11/0.38 # Presaturation interreduction done
% 0.11/0.38
% 0.11/0.38 # Proof found!
% 0.11/0.38 # SZS status Unsatisfiable
% 0.11/0.38 # SZS output start CNFRefutation
% See solution above
% 0.11/0.38 # Parsed axioms : 9
% 0.11/0.38 # Removed by relevancy pruning/SinE : 0
% 0.11/0.38 # Initial clauses : 9
% 0.11/0.38 # Removed in clause preprocessing : 1
% 0.11/0.38 # Initial clauses in saturation : 8
% 0.11/0.38 # Processed clauses : 903
% 0.11/0.38 # ...of these trivial : 1
% 0.11/0.38 # ...subsumed : 520
% 0.11/0.38 # ...remaining for further processing : 382
% 0.11/0.38 # Other redundant clauses eliminated : 0
% 0.11/0.38 # Clauses deleted for lack of memory : 0
% 0.11/0.38 # Backward-subsumed : 2
% 0.11/0.38 # Backward-rewritten : 2
% 0.11/0.38 # Generated clauses : 2359
% 0.11/0.38 # ...of the previous two non-redundant : 2293
% 0.11/0.38 # ...aggressively subsumed : 0
% 0.11/0.38 # Contextual simplify-reflections : 0
% 0.11/0.38 # Paramodulations : 2359
% 0.11/0.38 # Factorizations : 0
% 0.11/0.38 # NegExts : 0
% 0.11/0.38 # Equation resolutions : 0
% 0.11/0.38 # Total rewrite steps : 36
% 0.11/0.38 # Propositional unsat checks : 0
% 0.11/0.38 # Propositional check models : 0
% 0.11/0.38 # Propositional check unsatisfiable : 0
% 0.11/0.38 # Propositional clauses : 0
% 0.11/0.38 # Propositional clauses after purity: 0
% 0.11/0.38 # Propositional unsat core size : 0
% 0.11/0.38 # Propositional preprocessing time : 0.000
% 0.11/0.38 # Propositional encoding time : 0.000
% 0.11/0.38 # Propositional solver time : 0.000
% 0.11/0.38 # Success case prop preproc time : 0.000
% 0.11/0.38 # Success case prop encoding time : 0.000
% 0.11/0.38 # Success case prop solver time : 0.000
% 0.11/0.38 # Current number of processed clauses : 370
% 0.11/0.38 # Positive orientable unit clauses : 21
% 0.11/0.38 # Positive unorientable unit clauses: 0
% 0.11/0.38 # Negative unit clauses : 151
% 0.11/0.38 # Non-unit-clauses : 198
% 0.11/0.38 # Current number of unprocessed clauses: 1400
% 0.11/0.38 # ...number of literals in the above : 3589
% 0.11/0.38 # Current number of archived formulas : 0
% 0.11/0.38 # Current number of archived clauses : 13
% 0.11/0.38 # Clause-clause subsumption calls (NU) : 6777
% 0.11/0.38 # Rec. Clause-clause subsumption calls : 6777
% 0.11/0.38 # Non-unit clause-clause subsumptions : 319
% 0.11/0.38 # Unit Clause-clause subsumption calls : 292
% 0.11/0.38 # Rewrite failures with RHS unbound : 0
% 0.11/0.38 # BW rewrite match attempts : 202
% 0.11/0.38 # BW rewrite match successes : 2
% 0.11/0.38 # Condensation attempts : 0
% 0.11/0.38 # Condensation successes : 0
% 0.11/0.38 # Termbank termtop insertions : 44041
% 0.11/0.38
% 0.11/0.38 # -------------------------------------------------
% 0.11/0.38 # User time : 0.028 s
% 0.11/0.38 # System time : 0.006 s
% 0.11/0.38 # Total time : 0.033 s
% 0.11/0.38 # Maximum resident set size: 1648 pages
% 0.11/0.38
% 0.11/0.38 # -------------------------------------------------
% 0.11/0.38 # User time : 0.153 s
% 0.11/0.38 # System time : 0.015 s
% 0.11/0.38 # Total time : 0.167 s
% 0.11/0.38 # Maximum resident set size: 1676 pages
% 0.11/0.38 % E---3.1 exiting
% 0.11/0.38 % E---3.1 exiting
%------------------------------------------------------------------------------