TSTP Solution File: LCL657+1.001 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL657+1.001 : TPTP v8.1.2. Released v4.0.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:29:35 EDT 2023
% Result : CounterSatisfiable 0.19s 0.48s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_4,negated_conjecture,
( p1(X2)
| ~ r1(X1,X2)
| ~ p100(X2)
| ~ p1(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_5,negated_conjecture,
( r1(X1,esk3_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_6,negated_conjecture,
( r1(X1,esk2_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_7,negated_conjecture,
( p1(X1)
| ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_9,negated_conjecture,
( p1(esk3_1(X1))
| p101(X1)
| ~ p1(X1)
| ~ p100(esk3_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]),
[final] ).
cnf(c_0_10,negated_conjecture,
( p1(esk2_1(X1))
| p101(X1)
| ~ p1(X1)
| ~ p100(esk2_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]),
[final] ).
cnf(c_0_11,negated_conjecture,
( p1(X1)
| p101(X1)
| ~ p1(esk3_1(X1))
| ~ p100(esk3_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]),
[final] ).
cnf(c_0_12,negated_conjecture,
( p1(X1)
| p101(X1)
| ~ p1(esk2_1(X1))
| ~ p100(esk2_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]),
[final] ).
cnf(c_0_13,negated_conjecture,
( p2(X1)
| ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_14,negated_conjecture,
( p2(X2)
| ~ r1(X1,X2)
| ~ p101(X2)
| ~ p2(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_15,negated_conjecture,
( p101(esk3_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_16,negated_conjecture,
( p101(esk2_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_17,negated_conjecture,
( p101(X1)
| ~ p102(esk3_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_18,negated_conjecture,
( p101(X1)
| ~ p102(esk2_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_19,negated_conjecture,
( p101(X1)
| ~ p2(esk2_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_20,negated_conjecture,
( p2(esk3_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_21,negated_conjecture,
( p100(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_22,negated_conjecture,
( p101(X1)
| ~ p102(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_23,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
cnf(c_0_24,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
cnf(c_0_25,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL657+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 12:55:35 EDT 2023
% 0.12/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/tmp/tmp.eqhtLn1SNl/E---3.1_13024.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_1 with pid 13104 completed with status 1
% 0.19/0.48 # Result found by new_bool_1
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.19/0.48 # SAT001_CO_MinMin_p005000_rr with pid 13109 completed with status 1
% 0.19/0.48 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # No proof found!
% 0.19/0.48 # SZS status CounterSatisfiable
% 0.19/0.48 # SZS output start Saturation
% See solution above
% 0.19/0.48 # Parsed axioms : 2
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 17
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 17
% 0.19/0.48 # Processed clauses : 38
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 38
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 14
% 0.19/0.48 # ...of the previous two non-redundant : 4
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 14
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 21
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 18
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 17
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 42
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 16
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 1
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 38
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 2001
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.007 s
% 0.19/0.48 # Maximum resident set size: 1712 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1676 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------