TSTP Solution File: LCL178-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL178-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:55:47 EDT 2024
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 17 unt; 0 nHn; 14 RR)
% Number of literals : 40 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 41 ( 5 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_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_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
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_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_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(p),not(not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_7,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_8,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
c_0_7 ).
cnf(c_0_9,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_11,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_10 ).
cnf(c_0_13,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_15,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ theorem(or(not(p),not(not(p)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_23,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ theorem(or(not(p),not(not(p)))),
c_0_22 ).
cnf(c_0_25,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL178-1 : TPTP v8.2.0. Released v1.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.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:28:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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
% 0.19/0.47 # Version: 3.1.0
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # new_bool_3 with pid 2259 completed with status 0
% 0.19/0.47 # Result found by new_bool_3
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.19/0.47 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 2264 completed with status 0
% 0.19/0.47 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Unsatisfiable
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 9
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 9
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 9
% 0.19/0.47 # Processed clauses : 38
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 1
% 0.19/0.47 # ...remaining for further processing : 37
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 1
% 0.19/0.47 # Generated clauses : 41
% 0.19/0.47 # ...of the previous two non-redundant : 35
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 41
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 4
% 0.19/0.47 # ...of those cached : 0
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 27
% 0.19/0.47 # Positive orientable unit clauses : 12
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 5
% 0.19/0.47 # Non-unit-clauses : 10
% 0.19/0.47 # Current number of unprocessed clauses: 15
% 0.19/0.47 # ...number of literals in the above : 24
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 10
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 32
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 32
% 0.19/0.47 # Non-unit clause-clause subsumptions : 1
% 0.19/0.47 # Unit Clause-clause subsumption calls : 8
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 27
% 0.19/0.47 # BW rewrite match successes : 1
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 814
% 0.19/0.47 # Search garbage collected termcells : 17
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1604 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.006 s
% 0.19/0.47 # System time : 0.003 s
% 0.19/0.47 # Total time : 0.009 s
% 0.19/0.47 # Maximum resident set size: 1708 pages
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------