TSTP Solution File: SYN285-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN285-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:44 EDT 2024
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 19 RR)
% Number of literals : 38 ( 0 equ; 20 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 19 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_105,axiom,
( q1(X1,X1,X2)
| ~ s0(X1)
| ~ p0(X2,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_105) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_099,axiom,
( q1(X1,X2,X2)
| ~ k0(X3)
| ~ l0(X1)
| ~ q1(X2,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_099) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(prove_this,negated_conjecture,
~ q1(a,d,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(c_0_7,plain,
( q1(X1,X1,X2)
| ~ s0(X1)
| ~ p0(X2,d) ),
inference(fof_simplification,[status(thm)],[rule_105]) ).
cnf(c_0_8,plain,
( q1(X1,X1,X2)
| ~ s0(X1)
| ~ p0(X2,d) ),
c_0_7 ).
cnf(c_0_9,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_10,plain,
( q1(X1,X2,X2)
| ~ k0(X3)
| ~ l0(X1)
| ~ q1(X2,X2,X3) ),
inference(fof_simplification,[status(thm)],[rule_099]) ).
cnf(c_0_11,plain,
( q1(X1,X1,b)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
s0(d),
axiom_1 ).
cnf(c_0_13,plain,
( q1(X1,X2,X2)
| ~ k0(X3)
| ~ l0(X1)
| ~ q1(X2,X2,X3) ),
c_0_10 ).
cnf(c_0_14,plain,
q1(d,d,b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
k0(b),
axiom_32 ).
cnf(c_0_16,negated_conjecture,
~ q1(a,d,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_17,plain,
( q1(X1,d,d)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,axiom,
l0(a),
axiom_20 ).
cnf(c_0_19,negated_conjecture,
~ q1(a,d,d),
c_0_16 ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN285-1 : TPTP v8.2.0. Released v1.1.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n028.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 14:13:53 EDT 2024
% 0.12/0.33 % 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.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 29472 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # SAT001_MinMin_p005000_rr_RG with pid 29477 completed with status 0
% 0.19/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 369
% 0.19/0.50 # Removed by relevancy pruning/SinE : 160
% 0.19/0.50 # Initial clauses : 209
% 0.19/0.50 # Removed in clause preprocessing : 5
% 0.19/0.50 # Initial clauses in saturation : 204
% 0.19/0.50 # Processed clauses : 453
% 0.19/0.50 # ...of these trivial : 29
% 0.19/0.50 # ...subsumed : 15
% 0.19/0.50 # ...remaining for further processing : 409
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 7
% 0.19/0.50 # Backward-rewritten : 41
% 0.19/0.50 # Generated clauses : 399
% 0.19/0.50 # ...of the previous two non-redundant : 268
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 1
% 0.19/0.50 # Paramodulations : 399
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 321
% 0.19/0.50 # ...of those cached : 227
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 184
% 0.19/0.50 # Positive orientable unit clauses : 82
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 101
% 0.19/0.50 # Current number of unprocessed clauses: 189
% 0.19/0.50 # ...number of literals in the above : 404
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 225
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 10178
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 7640
% 0.19/0.50 # Non-unit clause-clause subsumptions : 21
% 0.19/0.50 # Unit Clause-clause subsumption calls : 130
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 109
% 0.19/0.50 # BW rewrite match successes : 28
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 12378
% 0.19/0.50 # Search garbage collected termcells : 1643
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.018 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.023 s
% 0.19/0.50 # Maximum resident set size: 2368 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.024 s
% 0.19/0.50 # System time : 0.008 s
% 0.19/0.50 # Total time : 0.032 s
% 0.19/0.50 # Maximum resident set size: 2020 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------