TSTP Solution File: SYN386+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN386+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:41 EDT 2023
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 49 ( 15 ~; 11 |; 11 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 6 sgn; 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2138,conjecture,
( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yGLTAIi6cI/E---3.1_23254.p',x2138) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[x2138]) ).
fof(c_0_2,negated_conjecture,
! [X11,X14,X16,X17,X19,X20,X21,X22,X23,X25] :
( big_f(X11,esk1_1(X11))
& ( ~ big_s(esk3_1(X14),X16)
| big_d(X16,esk2_0,X14) )
& ( ~ big_d(X19,X20,esk4_1(X17))
| ~ big_f(X19,X21)
| ~ big_f(X20,X22)
| big_d(X21,X22,X17) )
& big_s(X25,esk6_2(X23,X25))
& big_f(esk6_2(X23,X25),esk7_2(X23,X25))
& ~ big_d(esk7_2(X23,X25),X23,esk5_1(X23)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_d(X2,esk2_0,X1)
| ~ big_s(esk3_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_d(X4,X5,X3)
| ~ big_d(X1,X2,esk4_1(X3))
| ~ big_f(X1,X4)
| ~ big_f(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
big_d(esk6_2(X1,esk3_1(X2)),esk2_0,X2),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(esk6_2(X4,esk3_1(esk4_1(X3))),X1)
| ~ big_f(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( big_d(esk7_2(X1,esk3_1(esk4_1(X2))),X3,X2)
| ~ big_f(esk2_0,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ big_f(esk2_0,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
big_f(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN386+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 18:06:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.yGLTAIi6cI/E---3.1_23254.p
% 0.20/0.48 # Version: 3.1pre001
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_1 with pid 23334 completed with status 0
% 0.20/0.48 # Result found by new_bool_1
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.48 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 23339 completed with status 0
% 0.20/0.48 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 1
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 16
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 16
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 6
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 7
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 8
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 6
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 8
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 3
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 662
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1676 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------