TSTP Solution File: SYO338^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO338^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 08:45:39 EDT 2024
% Result : Theorem 35.78s 5.08s
% Output : CNFRefutation 35.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 364 ( 35 ~; 45 |; 18 &; 266 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 73 ( 14 ^ 41 !; 18 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
esk1_0: ( a > $o ) > a ).
thf(decl_24,type,
esk2_2: ( a > $o ) > a > a ).
thf(decl_25,type,
esk3_0: a > a ).
thf(cT145_DOUBLE,conjecture,
! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ? [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
| ( X1 @ X3 @ X4 ) )
& ( ( X1 @ X4 @ X5 )
| ( X1 @ X4 @ X5 ) )
& ( ~ ( X1 @ X3 @ X5 )
| ~ ( X1 @ X3 @ X5 ) ) )
| ? [X6: a > $o] :
( ? [X7: a] :
( ( ( X6 @ X7 )
| ( X6 @ X7 ) )
& ( ~ ( X1 @ X7 @ ( X2 @ X6 ) )
| ~ ( X1 @ X7 @ ( X2 @ X6 ) ) ) )
| ? [X8: a] :
( ! [X9: a] :
( ~ ( X6 @ X9 )
| ~ ( X6 @ X9 )
| ( X1 @ X9 @ X8 )
| ( X1 @ X9 @ X8 ) )
& ( ~ ( X1 @ ( X2 @ X6 ) @ X8 )
| ~ ( X1 @ ( X2 @ X6 ) @ X8 ) ) ) )
| ! [X10: a > a] :
( ? [X11: a,X12: a] :
( ( ( X1 @ X11 @ X12 )
| ( X1 @ X11 @ X12 ) )
& ( ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) )
| ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) ) ) )
| ? [X13: a] :
( ( ( X1 @ X13 @ ( X10 @ X13 ) )
| ( X1 @ X13 @ ( X10 @ X13 ) ) )
& ( ( X1 @ ( X10 @ X13 ) @ X13 )
| ( X1 @ ( X10 @ X13 ) @ X13 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cT145_DOUBLE) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ? [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 )
& ~ ( X1 @ X3 @ X5 ) )
| ? [X6: a > $o] :
( ? [X7: a] :
( ( X6 @ X7 )
& ~ ( X1 @ X7 @ ( X2 @ X6 ) ) )
| ? [X8: a] :
( ! [X9: a] :
( ~ ( X6 @ X9 )
| ( X1 @ X9 @ X8 )
| ( X1 @ X9 @ X8 ) )
& ~ ( X1 @ ( X2 @ X6 ) @ X8 ) ) )
| ! [X10: a > a] :
( ? [X11: a,X12: a] :
( ( X1 @ X11 @ X12 )
& ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) ) )
| ? [X13: a] :
( ( X1 @ X13 @ ( X10 @ X13 ) )
& ( X1 @ ( X10 @ X13 ) @ X13 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cT145_DOUBLE])]) ).
thf(c_0_2,negated_conjecture,
! [X29: a,X30: a,X31: a,X32: a > $o,X33: a,X34: a,X37: a,X38: a,X39: a] :
( ( ~ ( epred1_0 @ X29 @ X30 )
| ~ ( epred1_0 @ X30 @ X31 )
| ( epred1_0 @ X29 @ X31 ) )
& ( ~ ( X32 @ X33 )
| ( epred1_0 @ X33 @ ( esk1_0 @ X32 ) ) )
& ( ( X32 @ ( esk2_2 @ X32 @ X34 ) )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X32 @ X34 ) @ X34 )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X32 @ X34 ) @ X34 )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ X37 @ X38 )
| ( epred1_0 @ ( esk3_0 @ X37 ) @ ( esk3_0 @ X38 ) ) )
& ( ~ ( epred1_0 @ X39 @ ( esk3_0 @ X39 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X39 ) @ X39 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( epred1_0 @ X3 @ X5 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X4: a] :
( ( epred1_0 @ ( esk3_0 @ X3 ) @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( epred1_0 @ X3 @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ ( esk3_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X4 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( X6 @ ( esk2_2 @ X6 @ X3 ) )
| ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ X3 @ ( esk1_0 @ X6 ) )
| ~ ( X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X3: a,X23: a > a,X10: a > a,X4: a] :
( ( epred1_0
@ ( X10
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ Z0 ) ) )
@ X3 ) )
@ ( esk3_0 @ X4 ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ Z0 ) ) ) )
@ X3 )
| ~ ( epred1_0
@ ( X23
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ Z0 ) ) )
@ X3 ) )
@ X4 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > a > $o,X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 )
@ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 )
| ~ ( epred1_0 @ ( esk2_2 @ X6 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) )
@ X3 )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X10: a > a,X3: a] :
( ( epred1_0 @ ( esk3_0 @ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ ( X10 @ Z0 ) ) ) ) )
| ~ ( epred1_0 @ X3 @ ( X10 @ ( esk3_0 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_13,negated_conjecture,
( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: a] :
( ~ ( epred1_0 @ X3 @ ( esk3_0 @ X3 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( epred1_0
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO338^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:29:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 35.78/5.08 # Version: 3.1.0-ho
% 35.78/5.08 # Preprocessing class: HSMSSMSSSSSNHHA.
% 35.78/5.08 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 35.78/5.08 # Starting full_lambda_6 with 900s (3) cores
% 35.78/5.08 # Starting post_as_ho1 with 300s (1) cores
% 35.78/5.08 # Starting lpo6_lambda_fix with 300s (1) cores
% 35.78/5.08 # Starting ho_unfolding_1 with 300s (1) cores
% 35.78/5.08 # Starting new_ho_10_unif with 300s (1) cores
% 35.78/5.08 # Starting ho_unfolding_2 with 300s (1) cores
% 35.78/5.08 # post_as_ho1 with pid 7120 completed with status 0
% 35.78/5.08 # Result found by post_as_ho1
% 35.78/5.08 # Preprocessing class: HSMSSMSSSSSNHHA.
% 35.78/5.08 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 35.78/5.08 # Starting full_lambda_6 with 900s (3) cores
% 35.78/5.08 # Starting post_as_ho1 with 300s (1) cores
% 35.78/5.08 # No SInE strategy applied
% 35.78/5.08 # Search class: HGHNF-FFSF22-SHHFFSBN
% 35.78/5.08 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.78/5.08 # Starting new_ho_10_unif with 90s (1) cores
% 35.78/5.08 # new_ho_10_unif with pid 7128 completed with status 0
% 35.78/5.08 # Result found by new_ho_10_unif
% 35.78/5.08 # Preprocessing class: HSMSSMSSSSSNHHA.
% 35.78/5.08 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 35.78/5.08 # Starting full_lambda_6 with 900s (3) cores
% 35.78/5.08 # Starting post_as_ho1 with 300s (1) cores
% 35.78/5.08 # No SInE strategy applied
% 35.78/5.08 # Search class: HGHNF-FFSF22-SHHFFSBN
% 35.78/5.08 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.78/5.08 # Starting new_ho_10_unif with 90s (1) cores
% 35.78/5.08 # Preprocessing time : 0.001 s
% 35.78/5.08 # Presaturation interreduction done
% 35.78/5.08
% 35.78/5.08 # Proof found!
% 35.78/5.08 # SZS status Theorem
% 35.78/5.08 # SZS output start CNFRefutation
% See solution above
% 35.78/5.08 # Parsed axioms : 2
% 35.78/5.08 # Removed by relevancy pruning/SinE : 0
% 35.78/5.08 # Initial clauses : 8
% 35.78/5.08 # Removed in clause preprocessing : 1
% 35.78/5.08 # Initial clauses in saturation : 7
% 35.78/5.08 # Processed clauses : 769
% 35.78/5.08 # ...of these trivial : 118
% 35.78/5.08 # ...subsumed : 235
% 35.78/5.08 # ...remaining for further processing : 416
% 35.78/5.08 # Other redundant clauses eliminated : 0
% 35.78/5.08 # Clauses deleted for lack of memory : 0
% 35.78/5.08 # Backward-subsumed : 29
% 35.78/5.08 # Backward-rewritten : 39
% 35.78/5.08 # Generated clauses : 39506
% 35.78/5.08 # ...of the previous two non-redundant : 33989
% 35.78/5.08 # ...aggressively subsumed : 0
% 35.78/5.08 # Contextual simplify-reflections : 0
% 35.78/5.08 # Paramodulations : 39344
% 35.78/5.08 # Factorizations : 161
% 35.78/5.08 # NegExts : 0
% 35.78/5.08 # Equation resolutions : 1
% 35.78/5.08 # Disequality decompositions : 0
% 35.78/5.08 # Total rewrite steps : 5885
% 35.78/5.08 # ...of those cached : 5134
% 35.78/5.08 # Propositional unsat checks : 0
% 35.78/5.08 # Propositional check models : 0
% 35.78/5.08 # Propositional check unsatisfiable : 0
% 35.78/5.08 # Propositional clauses : 0
% 35.78/5.08 # Propositional clauses after purity: 0
% 35.78/5.08 # Propositional unsat core size : 0
% 35.78/5.08 # Propositional preprocessing time : 0.000
% 35.78/5.08 # Propositional encoding time : 0.000
% 35.78/5.08 # Propositional solver time : 0.000
% 35.78/5.08 # Success case prop preproc time : 0.000
% 35.78/5.08 # Success case prop encoding time : 0.000
% 35.78/5.08 # Success case prop solver time : 0.000
% 35.78/5.08 # Current number of processed clauses : 342
% 35.78/5.08 # Positive orientable unit clauses : 82
% 35.78/5.08 # Positive unorientable unit clauses: 0
% 35.78/5.08 # Negative unit clauses : 14
% 35.78/5.08 # Non-unit-clauses : 246
% 35.78/5.08 # Current number of unprocessed clauses: 32778
% 35.78/5.08 # ...number of literals in the above : 100999
% 35.78/5.08 # Current number of archived formulas : 0
% 35.78/5.08 # Current number of archived clauses : 74
% 35.78/5.08 # Clause-clause subsumption calls (NU) : 10348
% 35.78/5.08 # Rec. Clause-clause subsumption calls : 8763
% 35.78/5.08 # Non-unit clause-clause subsumptions : 258
% 35.78/5.08 # Unit Clause-clause subsumption calls : 2249
% 35.78/5.08 # Rewrite failures with RHS unbound : 0
% 35.78/5.08 # BW rewrite match attempts : 1688
% 35.78/5.08 # BW rewrite match successes : 48
% 35.78/5.08 # Condensation attempts : 769
% 35.78/5.08 # Condensation successes : 9
% 35.78/5.08 # Termbank termtop insertions : 10203298
% 35.78/5.08 # Search garbage collected termcells : 353
% 35.78/5.08
% 35.78/5.08 # -------------------------------------------------
% 35.78/5.08 # User time : 4.390 s
% 35.78/5.08 # System time : 0.149 s
% 35.78/5.08 # Total time : 4.539 s
% 35.78/5.08 # Maximum resident set size: 1696 pages
% 35.78/5.08
% 35.78/5.08 # -------------------------------------------------
% 35.78/5.08 # User time : 4.393 s
% 35.78/5.08 # System time : 0.150 s
% 35.78/5.08 # Total time : 4.543 s
% 35.78/5.08 # Maximum resident set size: 1736 pages
% 35.78/5.08 % E---3.1 exiting
% 35.78/5.08 % E exiting
%------------------------------------------------------------------------------