TSTP Solution File: SYN413+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:14:57 EDT 2023
% Result : Timeout 408.28s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 8 |; 5 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 3 sgn; 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish256,conjecture,
( ! [X1] :
? [X2] :
! [X3] :
( f(X3,X2)
<=> ( f(X3,X1)
& ~ f(X3,X3) ) )
=> ~ ? [X4] :
! [X5] : f(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.GJKVLAiaIX/E---3.1_9926.p',kalish256) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
? [X2] :
! [X3] :
( f(X3,X2)
<=> ( f(X3,X1)
& ~ f(X3,X3) ) )
=> ~ ? [X4] :
! [X5] : f(X5,X4) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[kalish256])]) ).
fof(c_0_2,negated_conjecture,
! [X6,X8,X9,X11] :
( ( f(X8,X6)
| ~ f(X8,esk1_1(X6)) )
& ( ~ f(X8,X8)
| ~ f(X8,esk1_1(X6)) )
& ( ~ f(X9,X6)
| f(X9,X9)
| f(X9,esk1_1(X6)) )
& f(X11,esk2_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( f(X1,X1)
| f(X1,esk1_1(X2))
| ~ f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
f(X1,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ f(X1,X1)
| ~ f(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( f(X1,esk1_1(esk2_0))
| f(X1,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
f(esk1_1(X1),esk1_1(esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
~ f(esk1_1(X1),esk1_1(X1)),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_8,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:25:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.GJKVLAiaIX/E---3.1_9926.p
% 408.28/300.09 # Version: 3.1pre001
% 408.28/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.09 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.09 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.09 # Starting sh5l with 300s (1) cores
% 408.28/300.09 # sh5l with pid 10032 completed with status 0
% 408.28/300.09 # Result found by sh5l
% 408.28/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.09 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.09 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.09 # Starting sh5l with 300s (1) cores
% 408.28/300.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.28/300.09 # Search class: FGHNF-FFSF11-SFFFFFNN
% 408.28/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/300.09 # SAT001_MinMin_p005000_rr_RG with pid 10034 completed with status 0
% 408.28/300.09 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.28/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.28/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.28/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.28/300.09 # Starting new_bool_3 with 300s (1) cores
% 408.28/300.09 # Starting new_bool_1 with 300s (1) cores
% 408.28/300.09 # Starting sh5l with 300s (1) cores
% 408.28/300.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.28/300.09 # Search class: FGHNF-FFSF11-SFFFFFNN
% 408.28/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.28/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.28/300.09 # Preprocessing time : 0.001 s
% 408.28/300.09 # Presaturation interreduction done
% 408.28/300.09
% 408.28/300.09 # Proof found!
% 408.28/300.09 # SZS status Theorem
% 408.28/300.09 # SZS output start CNFRefutation
% See solution above
% 408.28/300.09 # Parsed axioms : 1
% 408.28/300.09 # Removed by relevancy pruning/SinE : 0
% 408.28/300.09 # Initial clauses : 4
% 408.28/300.09 # Removed in clause preprocessing : 0
% 408.28/300.09 # Initial clauses in saturation : 4
% 408.28/300.09 # Processed clauses : 11
% 408.28/300.09 # ...of these trivial : 0
% 408.28/300.09 # ...subsumed : 0
% 408.28/300.09 # ...remaining for further processing : 11
% 408.28/300.09 # Other redundant clauses eliminated : 0
% 408.28/300.09 # Clauses deleted for lack of memory : 0
% 408.28/300.09 # Backward-subsumed : 0
% 408.28/300.09 # Backward-rewritten : 0
% 408.28/300.09 # Generated clauses : 14
% 408.28/300.09 # ...of the previous two non-redundant : 9
% 408.28/300.09 # ...aggressively subsumed : 0
% 408.28/300.09 # Contextual simplify-reflections : 1
% 408.28/300.09 # Paramodulations : 12
% 408.28/300.09 # Factorizations : 2
% 408.28/300.09 # NegExts : 0
% 408.28/300.09 # Equation resolutions : 0
% 408.28/300.09 # Total rewrite steps : 3
% 408.28/300.09 # Propositional unsat checks : 0
% 408.28/300.09 # Propositional check models : 0
% 408.28/300.09 # Propositional check unsatisfiable : 0
% 408.28/300.09 # Propositional clauses : 0
% 408.28/300.09 # Propositional clauses after purity: 0
% 408.28/300.09 # Propositional unsat core size : 0
% 408.28/300.09 # Propositional preprocessing time : 0.000
% 408.28/300.09 # Propositional encoding time : 0.000
% 408.28/300.09 # Propositional solver time : 0.000
% 408.28/300.09 # Success case prop preproc time : 0.000
% 408.28/300.09 # Success case prop encoding time : 0.000
% 408.28/300.09 # Success case prop solver time : 0.000
% 408.28/300.09 # Current number of processed clauses : 7
% 408.28/300.09 # Positive orientable unit clauses : 2
% 408.28/300.09 # Positive unorientable unit clauses: 0
% 408.28/300.09 # Negative unit clauses : 1
% 408.28/300.09 # Non-unit-clauses : 4
% 408.28/300.09 # Current number of unprocessed clauses: 6
% 408.28/300.09 # ...number of literals in the above : 11
% 408.28/300.09 # Current number of archived formulas : 0
% 408.28/300.09 # Current number of archived clauses : 4
% 408.28/300.09 # Clause-clause subsumption calls (NU) : 8
% 408.28/300.09 # Rec. Clause-clause subsumption calls : 8
% 408.28/300.09 # Non-unit clause-clause subsumptions : 1
% 408.28/300.09 # Unit Clause-clause subsumption calls : 0
% 408.28/300.09 # Rewrite failures with RHS unbound : 0
% 408.28/300.09 # BW rewrite match attempts : 0
% 408.28/300.09 # BW rewrite match successes : 0
% 408.28/300.09 # Condensation attempts : 0
% 408.28/300.09 # Condensation successes : 0
% 408.28/300.09 # Termbank termtop insertions : 449
% 408.28/300.09
% 408.28/300.09 # -------------------------------------------------
% 408.28/300.09 # User time : 0.003 s
% 408.28/300.09 # System time : 0.001 s
% 408.28/300.09 # Total time : 0.004 s
% 408.28/300.09 # Maximum resident set size: 1600 pages
% 408.28/300.09
% 408.28/300.09 # -------------------------------------------------
% 408.28/300.09 # User time : 0.003 s
% 408.28/300.09 # System time : 0.004 s
% 408.28/300.09 # Total time : 0.007 s
% 408.28/300.09 # Maximum resident set size: 1668 pages
% 408.28/300.09 % E---3.1 exiting
% 408.28/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------