TSTP Solution File: SYN268-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN268-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:43:58 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 28 RR)
% Number of literals : 46 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_088,axiom,
( p1(a,a,a)
| ~ l0(a) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).
cnf(rule_087,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_087) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_210,axiom,
( k3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_210) ).
cnf(prove_this,negated_conjecture,
~ p4(a,X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_287) ).
cnf(c_0_8,plain,
( p1(a,a,a)
| ~ l0(a) ),
inference(fof_simplification,[status(thm)],[rule_088]) ).
cnf(c_0_9,plain,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
inference(fof_simplification,[status(thm)],[rule_087]) ).
cnf(c_0_10,plain,
( p1(a,a,a)
| ~ l0(a) ),
c_0_8 ).
cnf(c_0_11,axiom,
l0(a),
axiom_20 ).
cnf(c_0_12,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_13,plain,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
c_0_9 ).
cnf(c_0_14,axiom,
r0(b),
axiom_9 ).
cnf(c_0_15,plain,
p1(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
( k3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_210]) ).
cnf(c_0_17,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_12 ).
cnf(c_0_18,plain,
p1(a,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
~ p4(a,X1,X2),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_20,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_287]) ).
cnf(c_0_21,plain,
( k3(X1,X1,X1)
| ~ n2(X1) ),
c_0_16 ).
cnf(c_0_22,plain,
n2(a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ p4(a,X1,X2),
c_0_19 ).
cnf(c_0_24,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
k3(a,a,a),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ k3(a,a,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN268-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n025.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 13:43:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 1281 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 1288 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.005 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 369
% 0.21/0.55 # Removed by relevancy pruning/SinE : 39
% 0.21/0.55 # Initial clauses : 330
% 0.21/0.55 # Removed in clause preprocessing : 6
% 0.21/0.55 # Initial clauses in saturation : 324
% 0.21/0.55 # Processed clauses : 451
% 0.21/0.55 # ...of these trivial : 13
% 0.21/0.55 # ...subsumed : 22
% 0.21/0.55 # ...remaining for further processing : 416
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 4
% 0.21/0.55 # Backward-rewritten : 21
% 0.21/0.55 # Generated clauses : 68
% 0.21/0.55 # ...of the previous two non-redundant : 63
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 1
% 0.21/0.55 # Paramodulations : 67
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 104
% 0.21/0.55 # ...of those cached : 51
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 100
% 0.21/0.55 # Positive orientable unit clauses : 63
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 2
% 0.21/0.55 # Non-unit-clauses : 35
% 0.21/0.55 # Current number of unprocessed clauses: 222
% 0.21/0.55 # ...number of literals in the above : 663
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 316
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 18412
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 12121
% 0.21/0.55 # Non-unit clause-clause subsumptions : 27
% 0.21/0.55 # Unit Clause-clause subsumption calls : 93
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 22
% 0.21/0.55 # BW rewrite match successes : 19
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 12316
% 0.21/0.55 # Search garbage collected termcells : 1510
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.036 s
% 0.21/0.55 # System time : 0.005 s
% 0.21/0.55 # Total time : 0.041 s
% 0.21/0.55 # Maximum resident set size: 2612 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.040 s
% 0.21/0.55 # System time : 0.009 s
% 0.21/0.55 # Total time : 0.049 s
% 0.21/0.55 # Maximum resident set size: 2024 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------