TSTP Solution File: SYN178-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN178-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 20:14:01 EDT 2023
% Result : Unsatisfiable 0.91s 0.63s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 21 unt; 0 nHn; 28 RR)
% Number of literals : 74 ( 0 equ; 38 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 49 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_28) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_17) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_14) ).
cnf(rule_187,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_187) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_181) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_19) ).
cnf(rule_255,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',rule_255) ).
cnf(prove_this,negated_conjecture,
~ q3(b,d),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',prove_this) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_32) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p',axiom_7) ).
cnf(c_0_14,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_15,axiom,
s0(d),
axiom_1 ).
cnf(c_0_16,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_17,axiom,
k0(e),
axiom_28 ).
cnf(c_0_18,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).
cnf(c_0_21,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
rule_187 ).
cnf(c_0_24,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_26,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( q2(X1,X2,X1)
| ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,plain,
( q2(X1,X2,X1)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_30,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_31,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
rule_255 ).
cnf(c_0_32,plain,
( q2(X1,X2,X1)
| ~ k0(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ q3(b,d),
prove_this ).
cnf(c_0_34,plain,
( q3(X1,X2)
| ~ k0(X1)
| ~ n0(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
k0(b),
axiom_32 ).
cnf(c_0_36,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SYN178-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n008.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 18:23:28 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.55 Running first-order theorem proving
% 0.22/0.55 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/tmp/tmp.bOR6xgqdsf/E---3.1_7468.p
% 0.91/0.63 # Version: 3.1pre001
% 0.91/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.91/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.91/0.63 # Starting sh5l with 300s (1) cores
% 0.91/0.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 7575 completed with status 0
% 0.91/0.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.91/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.63 # No SInE strategy applied
% 0.91/0.63 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.91/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.91/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.91/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.91/0.63 # Starting new_bool_3 with 136s (1) cores
% 0.91/0.63 # Starting new_bool_1 with 136s (1) cores
% 0.91/0.63 # Starting sh5l with 136s (1) cores
% 0.91/0.63 # SAT001_MinMin_p005000_rr_RG with pid 7580 completed with status 0
% 0.91/0.63 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.91/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.91/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.91/0.63 # No SInE strategy applied
% 0.91/0.63 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.91/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.91/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.91/0.63 # Preprocessing time : 0.003 s
% 0.91/0.63 # Presaturation interreduction done
% 0.91/0.63
% 0.91/0.63 # Proof found!
% 0.91/0.63 # SZS status Unsatisfiable
% 0.91/0.63 # SZS output start CNFRefutation
% See solution above
% 0.91/0.63 # Parsed axioms : 369
% 0.91/0.63 # Removed by relevancy pruning/SinE : 0
% 0.91/0.63 # Initial clauses : 369
% 0.91/0.63 # Removed in clause preprocessing : 7
% 0.91/0.63 # Initial clauses in saturation : 362
% 0.91/0.63 # Processed clauses : 1287
% 0.91/0.63 # ...of these trivial : 57
% 0.91/0.63 # ...subsumed : 84
% 0.91/0.63 # ...remaining for further processing : 1146
% 0.91/0.63 # Other redundant clauses eliminated : 0
% 0.91/0.63 # Clauses deleted for lack of memory : 0
% 0.91/0.63 # Backward-subsumed : 74
% 0.91/0.63 # Backward-rewritten : 322
% 0.91/0.63 # Generated clauses : 1768
% 0.91/0.63 # ...of the previous two non-redundant : 1287
% 0.91/0.63 # ...aggressively subsumed : 0
% 0.91/0.63 # Contextual simplify-reflections : 2
% 0.91/0.63 # Paramodulations : 1768
% 0.91/0.63 # Factorizations : 0
% 0.91/0.63 # NegExts : 0
% 0.91/0.63 # Equation resolutions : 0
% 0.91/0.63 # Total rewrite steps : 1281
% 0.91/0.63 # Propositional unsat checks : 0
% 0.91/0.63 # Propositional check models : 0
% 0.91/0.63 # Propositional check unsatisfiable : 0
% 0.91/0.63 # Propositional clauses : 0
% 0.91/0.63 # Propositional clauses after purity: 0
% 0.91/0.63 # Propositional unsat core size : 0
% 0.91/0.63 # Propositional preprocessing time : 0.000
% 0.91/0.63 # Propositional encoding time : 0.000
% 0.91/0.63 # Propositional solver time : 0.000
% 0.91/0.63 # Success case prop preproc time : 0.000
% 0.91/0.63 # Success case prop encoding time : 0.000
% 0.91/0.63 # Success case prop solver time : 0.000
% 0.91/0.63 # Current number of processed clauses : 422
% 0.91/0.63 # Positive orientable unit clauses : 201
% 0.91/0.63 # Positive unorientable unit clauses: 0
% 0.91/0.63 # Negative unit clauses : 1
% 0.91/0.63 # Non-unit-clauses : 220
% 0.91/0.63 # Current number of unprocessed clauses: 415
% 0.91/0.63 # ...number of literals in the above : 1193
% 0.91/0.63 # Current number of archived formulas : 0
% 0.91/0.63 # Current number of archived clauses : 724
% 0.91/0.63 # Clause-clause subsumption calls (NU) : 58049
% 0.91/0.63 # Rec. Clause-clause subsumption calls : 42069
% 0.91/0.63 # Non-unit clause-clause subsumptions : 147
% 0.91/0.63 # Unit Clause-clause subsumption calls : 5104
% 0.91/0.63 # Rewrite failures with RHS unbound : 0
% 0.91/0.63 # BW rewrite match attempts : 741
% 0.91/0.63 # BW rewrite match successes : 201
% 0.91/0.63 # Condensation attempts : 0
% 0.91/0.63 # Condensation successes : 0
% 0.91/0.63 # Termbank termtop insertions : 28700
% 0.91/0.63
% 0.91/0.63 # -------------------------------------------------
% 0.91/0.63 # User time : 0.063 s
% 0.91/0.63 # System time : 0.004 s
% 0.91/0.63 # Total time : 0.067 s
% 0.91/0.63 # Maximum resident set size: 2488 pages
% 0.91/0.63
% 0.91/0.63 # -------------------------------------------------
% 0.91/0.63 # User time : 0.313 s
% 0.91/0.63 # System time : 0.011 s
% 0.91/0.63 # Total time : 0.324 s
% 0.91/0.63 # Maximum resident set size: 2000 pages
% 0.91/0.63 % E---3.1 exiting
% 0.91/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------