TSTP Solution File: LCL248-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL248-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:45:45 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 53 ( 33 unt; 0 nHn; 19 RR)
% Number of literals : 78 ( 6 equ; 29 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; 2 con; 0-2 aty)
% Number of variables : 109 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(and(p,q),implies(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_9 ).
cnf(c_0_12,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_13,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_10 ).
cnf(c_0_15,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_19,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_20,plain,
( theorem(implies(or(X1,X2),or(X1,X3)))
| ~ theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,plain,
( theorem(or(X1,implies(X2,X3)))
| ~ theorem(implies(X2,or(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_24,plain,
theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_26,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_18]) ).
cnf(c_0_27,plain,
theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,plain,
theorem(implies(or(X1,X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_29,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(implies(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_31,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_32,plain,
theorem(implies(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_35,plain,
theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_36,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_37,plain,
theorem(or(X1,implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_38,plain,
implies(implies(X1,not(X2)),X3) = or(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_39,plain,
( theorem(or(X1,not(X1)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_40,plain,
theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(implies(and(p,q),implies(p,q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_42,plain,
( theorem(implies(X1,implies(X2,X3)))
| ~ theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_18]) ).
cnf(c_0_43,plain,
( theorem(implies(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_18]) ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ theorem(or(and(X3,X1),X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_37]),c_0_38]) ).
cnf(c_0_45,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(implies(and(p,q),implies(p,q))),
c_0_41 ).
cnf(c_0_47,plain,
( theorem(implies(X1,implies(X2,X3)))
| ~ theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_49,plain,
theorem(or(X1,not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
~ theorem(implies(and(p,q),q)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
theorem(implies(and(X1,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_18]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL248-3 : TPTP v8.2.0. Released v2.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:24:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # sh5l with pid 23960 completed with status 0
% 0.19/0.51 # Result found by sh5l
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.51 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.51 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23967 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.51 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 10
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 10
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 10
% 0.19/0.51 # Processed clauses : 595
% 0.19/0.51 # ...of these trivial : 27
% 0.19/0.51 # ...subsumed : 366
% 0.19/0.51 # ...remaining for further processing : 202
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 2
% 0.19/0.51 # Backward-rewritten : 16
% 0.19/0.51 # Generated clauses : 2206
% 0.19/0.51 # ...of the previous two non-redundant : 1978
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 2206
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 538
% 0.19/0.51 # ...of those cached : 339
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 174
% 0.19/0.51 # Positive orientable unit clauses : 62
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 4
% 0.19/0.51 # Non-unit-clauses : 108
% 0.19/0.51 # Current number of unprocessed clauses: 1311
% 0.19/0.51 # ...number of literals in the above : 2446
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 28
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 4837
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 4444
% 0.19/0.51 # Non-unit clause-clause subsumptions : 366
% 0.19/0.51 # Unit Clause-clause subsumption calls : 78
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 237
% 0.19/0.51 # BW rewrite match successes : 13
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 23125
% 0.19/0.51 # Search garbage collected termcells : 11
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.032 s
% 0.19/0.51 # System time : 0.003 s
% 0.19/0.51 # Total time : 0.035 s
% 0.19/0.51 # Maximum resident set size: 1692 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.032 s
% 0.19/0.51 # System time : 0.006 s
% 0.19/0.51 # Total time : 0.038 s
% 0.19/0.51 # Maximum resident set size: 1712 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------