TSTP Solution File: SYN290-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN290-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 07:44:03 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_093,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_093) ).
cnf(prove_this,negated_conjecture,
~ q1(c,X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(c_0_3,plain,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_093]) ).
cnf(c_0_4,negated_conjecture,
~ q1(c,X1,X2),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_5,plain,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
c_0_3 ).
cnf(c_0_6,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_7,negated_conjecture,
~ q1(c,X1,X2),
c_0_4 ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SYN290-1 : TPTP v8.2.0. Released v1.1.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 14:24:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_1 with pid 25647 completed with status 0
% 0.21/0.52 # Result found by new_bool_1
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 25650 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 369
% 0.21/0.52 # Removed by relevancy pruning/SinE : 160
% 0.21/0.52 # Initial clauses : 209
% 0.21/0.52 # Removed in clause preprocessing : 5
% 0.21/0.52 # Initial clauses in saturation : 204
% 0.21/0.52 # Processed clauses : 294
% 0.21/0.52 # ...of these trivial : 12
% 0.21/0.52 # ...subsumed : 16
% 0.21/0.52 # ...remaining for further processing : 266
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 5
% 0.21/0.52 # Generated clauses : 64
% 0.21/0.52 # ...of the previous two non-redundant : 50
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 1
% 0.21/0.52 # Paramodulations : 64
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 77
% 0.21/0.52 # ...of those cached : 41
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 83
% 0.21/0.52 # Positive orientable unit clauses : 57
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 24
% 0.21/0.52 # Current number of unprocessed clauses: 137
% 0.21/0.52 # ...number of literals in the above : 358
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 183
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 6511
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 4716
% 0.21/0.52 # Non-unit clause-clause subsumptions : 18
% 0.21/0.52 # Unit Clause-clause subsumption calls : 6
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 5
% 0.21/0.52 # BW rewrite match successes : 5
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 8648
% 0.21/0.52 # Search garbage collected termcells : 1643
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 2368 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.016 s
% 0.21/0.52 # System time : 0.011 s
% 0.21/0.52 # Total time : 0.027 s
% 0.21/0.52 # Maximum resident set size: 2020 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------