TSTP Solution File: LCL205-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL205-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 42 ( 25 unt; 0 nHn; 20 RR)
% Number of literals : 64 ( 2 equ; 27 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; 2 con; 0-2 aty)
% Number of variables : 75 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.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.oJ7zewHlct/E---3.1_30214.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.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.oJ7zewHlct/E---3.1_30214.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(implies(p,q)),implies(p,not(q)))),
file('/export/starexec/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.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,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,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_19,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_21,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_24,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_19,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_28,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_30,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ theorem(implies(not(implies(p,q)),implies(p,not(q)))),
prove_this ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_34,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_36,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_37,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),not(q))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ theorem(or(not(q),or(not(p),q))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_12]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : LCL205-3 : TPTP v8.1.2. Released v2.3.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.08/0.30 % Computer : n010.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 2400
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Mon Oct 2 12:41:50 EDT 2023
% 0.08/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.oJ7zewHlct/E---3.1_30214.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30292 completed with status 0
% 0.14/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.14/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30298 completed with status 0
% 0.14/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.43 # Preprocessing time : 0.004 s
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Unsatisfiable
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 9
% 0.14/0.43 # Removed by relevancy pruning/SinE : 0
% 0.14/0.43 # Initial clauses : 9
% 0.14/0.43 # Removed in clause preprocessing : 1
% 0.14/0.43 # Initial clauses in saturation : 8
% 0.14/0.43 # Processed clauses : 244
% 0.14/0.43 # ...of these trivial : 0
% 0.14/0.43 # ...subsumed : 114
% 0.14/0.43 # ...remaining for further processing : 130
% 0.14/0.43 # Other redundant clauses eliminated : 0
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 1
% 0.14/0.43 # Backward-rewritten : 0
% 0.14/0.43 # Generated clauses : 786
% 0.14/0.43 # ...of the previous two non-redundant : 758
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 0
% 0.14/0.43 # Paramodulations : 786
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 0
% 0.14/0.43 # Total rewrite steps : 3
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 129
% 0.14/0.43 # Positive orientable unit clauses : 8
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 23
% 0.14/0.43 # Non-unit-clauses : 98
% 0.14/0.43 # Current number of unprocessed clauses: 508
% 0.14/0.43 # ...number of literals in the above : 1409
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 2
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 2155
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 2075
% 0.14/0.43 # Non-unit clause-clause subsumptions : 107
% 0.14/0.43 # Unit Clause-clause subsumption calls : 90
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 42
% 0.14/0.43 # BW rewrite match successes : 1
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 10490
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.021 s
% 0.14/0.43 # System time : 0.002 s
% 0.14/0.43 # Total time : 0.023 s
% 0.14/0.43 # Maximum resident set size: 1652 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.105 s
% 0.14/0.43 # System time : 0.010 s
% 0.14/0.43 # Total time : 0.116 s
% 0.14/0.43 # Maximum resident set size: 1680 pages
% 0.14/0.43 % E---3.1 exiting
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------