TSTP Solution File: SYO208^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO208^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:09 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 23 ( 11 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 11 ~; 6 |; 1 &; 35 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 20 ( 3 ^ 13 !; 4 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
esk1_1: ( a > $o ) > a ).
thf(cCT31,conjecture,
~ ? [X1: a > a > $o] :
! [X2: a > $o] :
? [X3: a] :
( ( ( X1 @ X3 )
= X2 )
<=> ( X2 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT31) ).
thf(c_0_1,negated_conjecture,
~ ~ ? [X1: a > a > $o] :
! [X2: a > $o] :
? [X3: a] :
( ( ( X1 @ X3 )
= X2 )
<=> ( X2 = X2 ) ),
inference(assume_negation,[status(cth)],[cCT31]) ).
thf(c_0_2,negated_conjecture,
! [X8: a > $o] :
( ( ( ( epred1_0 @ ( esk1_1 @ X8 ) )
!= X8 )
| ( X8 = X8 ) )
& ( ( X8 != X8 )
| ( ( epred1_0 @ ( esk1_1 @ X8 ) )
= X8 ) ) ),
inference(fof_nnf,[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,
! [X2: a > $o] :
( ( ( epred1_0 @ ( esk1_1 @ X2 ) )
= X2 )
| ( X2 != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a > $o] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
= X2 ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: a > $o,X10: a] :
( ( epred1_0 @ ( esk1_1 @ X2 ) @ X10 )
<=> ( X2 @ X10 ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: a > $o,X3: a] :
( ( epred1_0 @ ( esk1_1 @ X2 ) @ X3 )
| ~ ( X2 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X2: a > $o,X3: a] :
( ( epred1_0
@ ( esk1_1
@ ^ [Z0: a] :
~ ( X2 @ Z0 ) )
@ X3 )
| ( X2 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > $o,X3: a] :
( ( X2 @ X3 )
| ~ ( epred1_0 @ ( esk1_1 @ X2 ) @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( epred1_0
@ ( esk1_1
@ ^ [Z0: a] :
~ ( epred1_0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: a] :
~ ( epred1_0 @ Z0 @ Z0 ) ) ),
inference(ef,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO208^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n014.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 20 10:08:37 EDT 2024
% 0.13/0.32 % CPUTime :
% 0.17/0.45 Running higher-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.46 # Version: 3.1.0-ho
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.17/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho4 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho2 with 300s (1) cores
% 0.17/0.46 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.17/0.46 # Starting full_lambda_10 with 300s (1) cores
% 0.17/0.46 # Starting new_ho_8 with 300s (1) cores
% 0.17/0.46 # post_as_ho1 with pid 626 completed with status 0
% 0.17/0.46 # Result found by post_as_ho1
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.17/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HUUPF-FFSF11-SSSFFFBN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting post_as_ho10 with 163s (1) cores
% 0.17/0.46 # post_as_ho10 with pid 634 completed with status 0
% 0.17/0.46 # Result found by post_as_ho10
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.17/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.17/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HUUPF-FFSF11-SSSFFFBN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting post_as_ho10 with 163s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 2
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 3
% 0.17/0.46 # Removed in clause preprocessing : 2
% 0.17/0.46 # Initial clauses in saturation : 1
% 0.17/0.46 # Processed clauses : 17
% 0.17/0.46 # ...of these trivial : 2
% 0.17/0.46 # ...subsumed : 3
% 0.17/0.46 # ...remaining for further processing : 12
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 33
% 0.17/0.46 # ...of the previous two non-redundant : 24
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 15
% 0.17/0.46 # Factorizations : 2
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 1
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 4
% 0.17/0.46 # ...of those cached : 1
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 10
% 0.17/0.46 # Positive orientable unit clauses : 5
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 4
% 0.17/0.46 # Current number of unprocessed clauses: 8
% 0.17/0.46 # ...number of literals in the above : 13
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 2
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 10
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 10
% 0.17/0.46 # Non-unit clause-clause subsumptions : 2
% 0.17/0.46 # Unit Clause-clause subsumption calls : 3
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 4
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 1541
% 0.17/0.46 # Search garbage collected termcells : 42
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.004 s
% 0.17/0.46 # Maximum resident set size: 1592 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.005 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.007 s
% 0.17/0.46 # Maximum resident set size: 1704 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------