TSTP Solution File: SYN264-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN264-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:57:39 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 40 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_063,axiom,
( p1(X1,X1,X2)
| ~ n0(d,X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_063) ).
cnf(rule_071,axiom,
( p1(X1,X2,X1)
| ~ l0(X3)
| ~ p1(X2,X4,X1)
| ~ s0(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_071) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(prove_this,negated_conjecture,
~ p1(e,c,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(c_0_7,plain,
( p1(X1,X1,X2)
| ~ n0(d,X1)
| ~ k0(X2) ),
inference(fof_simplification,[status(thm)],[rule_063]) ).
cnf(c_0_8,plain,
( p1(X1,X2,X1)
| ~ l0(X3)
| ~ p1(X2,X4,X1)
| ~ s0(b) ),
inference(fof_simplification,[status(thm)],[rule_071]) ).
cnf(c_0_9,plain,
( p1(X1,X1,X2)
| ~ n0(d,X1)
| ~ k0(X2) ),
c_0_7 ).
cnf(c_0_10,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_11,plain,
( p1(X1,X2,X1)
| ~ l0(X3)
| ~ p1(X2,X4,X1)
| ~ s0(b) ),
c_0_8 ).
cnf(c_0_12,axiom,
s0(b),
axiom_5 ).
cnf(c_0_13,plain,
( p1(c,c,X1)
| ~ k0(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
k0(e),
axiom_28 ).
cnf(c_0_15,negated_conjecture,
~ p1(e,c,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_16,plain,
( p1(X1,X2,X1)
| ~ p1(X2,X3,X1)
| ~ l0(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_17,plain,
p1(c,c,e),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ p1(e,c,e),
c_0_15 ).
cnf(c_0_19,axiom,
l0(c),
axiom_24 ).
cnf(c_0_20,plain,
~ l0(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN264-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 14:31:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 25631 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 25634 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 369
% 0.21/0.53 # Removed by relevancy pruning/SinE : 160
% 0.21/0.53 # Initial clauses : 209
% 0.21/0.53 # Removed in clause preprocessing : 5
% 0.21/0.53 # Initial clauses in saturation : 204
% 0.21/0.53 # Processed clauses : 470
% 0.21/0.53 # ...of these trivial : 28
% 0.21/0.53 # ...subsumed : 20
% 0.21/0.53 # ...remaining for further processing : 422
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 21
% 0.21/0.53 # Backward-rewritten : 21
% 0.21/0.53 # Generated clauses : 455
% 0.21/0.53 # ...of the previous two non-redundant : 289
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 1
% 0.21/0.53 # Paramodulations : 453
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 331
% 0.21/0.53 # ...of those cached : 251
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 201
% 0.21/0.53 # Positive orientable unit clauses : 97
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 2
% 0.21/0.53 # Non-unit-clauses : 102
% 0.21/0.53 # Current number of unprocessed clauses: 187
% 0.21/0.53 # ...number of literals in the above : 412
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 221
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 10725
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 8216
% 0.21/0.53 # Non-unit clause-clause subsumptions : 25
% 0.21/0.53 # Unit Clause-clause subsumption calls : 164
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 44
% 0.21/0.53 # BW rewrite match successes : 17
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 13000
% 0.21/0.53 # Search garbage collected termcells : 1643
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.034 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.035 s
% 0.21/0.53 # Maximum resident set size: 2372 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.040 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.043 s
% 0.21/0.53 # Maximum resident set size: 2020 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------