TSTP Solution File: LCL250-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL250-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:56:14 EDT 2024
% Result : Unsatisfiable 17.76s 2.72s
% Output : CNFRefutation 17.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 60 ( 22 unt; 0 nHn; 30 RR)
% Number of literals : 109 ( 0 equ; 52 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 150 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
c_0_9 ).
cnf(c_0_11,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_12,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_13,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_14,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_19,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_20,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
c_0_18 ).
cnf(c_0_23,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_19 ).
cnf(c_0_24,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(or(X2,X3),X4)))
| ~ theorem(or(or(X1,X4),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_26,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(or(or(or(X1,X2),X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_29,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_30,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_31,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_32,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_34,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_35,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_36,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( theorem(or(not(X1),or(not(not(X2)),X3)))
| ~ axiom(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_38,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
( theorem(or(not(X1),or(not(not(X2)),X3)))
| ~ axiom(or(not(X1),X4))
| ~ axiom(or(not(X4),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_40,plain,
( theorem(or(not(or(X1,X2)),X2))
| ~ theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_13]) ).
cnf(c_0_41,plain,
( theorem(or(not(X1),or(not(not(X2)),X3)))
| ~ axiom(or(not(or(X4,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_42,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_43,plain,
theorem(or(not(X1),or(not(not(or(X2,or(X3,X1)))),X4))),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_44,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(not(not(or(X3,X1))),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_42,c_0_28]) ).
cnf(c_0_45,plain,
theorem(or(not(not(or(X1,or(X2,X3)))),or(not(X3),X4))),
inference(spm,[status(thm)],[c_0_14,c_0_43]) ).
cnf(c_0_46,plain,
theorem(or(not(or(not(or(X1,X2)),X3)),or(not(X2),X3))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
( theorem(or(not(X1),or(not(X2),X3)))
| ~ axiom(or(not(X1),or(not(or(X4,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_48,plain,
( theorem(or(not(X1),or(X2,X3)))
| ~ theorem(or(not(X4),X3))
| ~ axiom(or(not(X1),or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_49,plain,
theorem(or(not(or(X1,not(or(X2,X3)))),or(not(X3),X1))),
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_50,plain,
( theorem(or(not(or(X1,X2)),or(X2,X3)))
| ~ theorem(or(not(X1),X3)) ),
inference(spm,[status(thm)],[c_0_48,c_0_13]) ).
cnf(c_0_51,plain,
( theorem(or(not(X1),or(not(X2),X3)))
| ~ axiom(or(not(X1),or(X3,not(or(X4,X2))))) ),
inference(spm,[status(thm)],[c_0_22,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_53,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,or(X1,or(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_54,plain,
( theorem(or(X1,or(not(or(X2,X1)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_50]) ).
cnf(c_0_55,plain,
theorem(or(not(not(or(X1,X2))),or(not(X2),X3))),
inference(spm,[status(thm)],[c_0_51,c_0_12]) ).
cnf(c_0_56,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
c_0_52 ).
cnf(c_0_57,plain,
( theorem(or(not(or(X1,X2)),or(X3,X2)))
| ~ theorem(or(not(X1),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
theorem(or(not(X1),or(not(not(or(X2,X1))),X3))),
inference(spm,[status(thm)],[c_0_14,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL250-1 : TPTP v8.2.0. Bugfixed v2.3.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 01:20:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 17.76/2.72 # Version: 3.1.0
% 17.76/2.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.76/2.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.76/2.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.76/2.72 # Starting new_bool_3 with 300s (1) cores
% 17.76/2.72 # Starting new_bool_1 with 300s (1) cores
% 17.76/2.72 # Starting sh5l with 300s (1) cores
% 17.76/2.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13520 completed with status 0
% 17.76/2.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.76/2.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.76/2.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.76/2.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.76/2.72 # No SInE strategy applied
% 17.76/2.72 # Search class: FHUNM-FFSF21-DFFFFFNN
% 17.76/2.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.76/2.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 17.76/2.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.76/2.72 # Starting new_bool_3 with 296s (1) cores
% 17.76/2.72 # Starting new_bool_1 with 291s (1) cores
% 17.76/2.72 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.76/2.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13526 completed with status 0
% 17.76/2.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.76/2.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.76/2.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.76/2.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.76/2.72 # No SInE strategy applied
% 17.76/2.72 # Search class: FHUNM-FFSF21-DFFFFFNN
% 17.76/2.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.76/2.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 17.76/2.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.76/2.72 # Preprocessing time : 0.002 s
% 17.76/2.72 # Presaturation interreduction done
% 17.76/2.72
% 17.76/2.72 # Proof found!
% 17.76/2.72 # SZS status Unsatisfiable
% 17.76/2.72 # SZS output start CNFRefutation
% See solution above
% 17.76/2.72 # Parsed axioms : 9
% 17.76/2.72 # Removed by relevancy pruning/SinE : 0
% 17.76/2.72 # Initial clauses : 9
% 17.76/2.72 # Removed in clause preprocessing : 0
% 17.76/2.72 # Initial clauses in saturation : 9
% 17.76/2.72 # Processed clauses : 14654
% 17.76/2.72 # ...of these trivial : 1680
% 17.76/2.72 # ...subsumed : 9326
% 17.76/2.72 # ...remaining for further processing : 3648
% 17.76/2.72 # Other redundant clauses eliminated : 0
% 17.76/2.72 # Clauses deleted for lack of memory : 0
% 17.76/2.72 # Backward-subsumed : 7
% 17.76/2.72 # Backward-rewritten : 5
% 17.76/2.72 # Generated clauses : 144039
% 17.76/2.72 # ...of the previous two non-redundant : 123973
% 17.76/2.72 # ...aggressively subsumed : 0
% 17.76/2.72 # Contextual simplify-reflections : 0
% 17.76/2.72 # Paramodulations : 144039
% 17.76/2.72 # Factorizations : 0
% 17.76/2.72 # NegExts : 0
% 17.76/2.72 # Equation resolutions : 0
% 17.76/2.72 # Disequality decompositions : 0
% 17.76/2.72 # Total rewrite steps : 21726
% 17.76/2.72 # ...of those cached : 15690
% 17.76/2.72 # Propositional unsat checks : 0
% 17.76/2.72 # Propositional check models : 0
% 17.76/2.72 # Propositional check unsatisfiable : 0
% 17.76/2.72 # Propositional clauses : 0
% 17.76/2.72 # Propositional clauses after purity: 0
% 17.76/2.72 # Propositional unsat core size : 0
% 17.76/2.72 # Propositional preprocessing time : 0.000
% 17.76/2.72 # Propositional encoding time : 0.000
% 17.76/2.72 # Propositional solver time : 0.000
% 17.76/2.72 # Success case prop preproc time : 0.000
% 17.76/2.72 # Success case prop encoding time : 0.000
% 17.76/2.72 # Success case prop solver time : 0.000
% 17.76/2.72 # Current number of processed clauses : 3627
% 17.76/2.72 # Positive orientable unit clauses : 1201
% 17.76/2.72 # Positive unorientable unit clauses: 0
% 17.76/2.72 # Negative unit clauses : 57
% 17.76/2.72 # Non-unit-clauses : 2369
% 17.76/2.72 # Current number of unprocessed clauses: 109287
% 17.76/2.72 # ...number of literals in the above : 174686
% 17.76/2.72 # Current number of archived formulas : 0
% 17.76/2.72 # Current number of archived clauses : 21
% 17.76/2.72 # Clause-clause subsumption calls (NU) : 1728571
% 17.76/2.72 # Rec. Clause-clause subsumption calls : 1728333
% 17.76/2.72 # Non-unit clause-clause subsumptions : 9272
% 17.76/2.72 # Unit Clause-clause subsumption calls : 49629
% 17.76/2.72 # Rewrite failures with RHS unbound : 0
% 17.76/2.72 # BW rewrite match attempts : 344354
% 17.76/2.72 # BW rewrite match successes : 3
% 17.76/2.72 # Condensation attempts : 0
% 17.76/2.72 # Condensation successes : 0
% 17.76/2.72 # Termbank termtop insertions : 2153849
% 17.76/2.72 # Search garbage collected termcells : 17
% 17.76/2.72
% 17.76/2.72 # -------------------------------------------------
% 17.76/2.72 # User time : 2.118 s
% 17.76/2.72 # System time : 0.067 s
% 17.76/2.72 # Total time : 2.185 s
% 17.76/2.72 # Maximum resident set size: 1640 pages
% 17.76/2.72
% 17.76/2.72 # -------------------------------------------------
% 17.76/2.72 # User time : 10.640 s
% 17.76/2.72 # System time : 0.231 s
% 17.76/2.72 # Total time : 10.871 s
% 17.76/2.72 # Maximum resident set size: 1712 pages
% 17.76/2.72 % E---3.1 exiting
%------------------------------------------------------------------------------