TSTP Solution File: SYO531^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO531^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:47:58 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 22 ( 7 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 113 ( 10 ~; 6 |; 1 &; 93 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 68 ( 68 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 49 ( 11 ^ 21 !; 17 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
epsa: ( $i > $i > $o ) > $i ).
thf(decl_24,type,
epred1_1: ( ( $i > $i > $o ) > $i ) > $i > $i > $o ).
thf(decl_25,type,
esk1_1: ( ( $i > $i > $o ) > $i ) > $i ).
thf(decl_26,type,
esk2_1: ( ( $i > $i > $o ) > $i ) > $i ).
thf(decl_35,type,
esk11_1: ( $i > $i > $o ) > $i ).
thf(epsad,axiom,
( epsa
= ( ^ [X3: $i > $i > $o] :
( eps
@ ^ [X2: $i] :
? [X4: $i] : ( X3 @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsad) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceax) ).
thf(conj,conjecture,
? [X5: ( $i > $i > $o ) > $i] :
! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( X5 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_3,plain,
( epsa
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
? [X4: $i] : ( Z0 @ Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[epsad]) ).
thf(c_0_4,plain,
! [X12: $i > $o,X13: $i] :
( ~ ( X12 @ X13 )
| ( X12 @ ( eps @ X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_5,plain,
( epsa
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
? [X46: $i] : ( Z0 @ Z1 @ X46 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
~ ? [X5: ( $i > $i > $o ) > $i] :
! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( X5 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_7,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X3: $i > $i > $o] :
( ( eps
@ ^ [Z0: $i] :
? [X47: $i] : ( X3 @ Z0 @ X47 ) )
= ( epsa @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X14: ( $i > $i > $o ) > $i] :
( ( epred1_1 @ X14 @ ( esk1_1 @ X14 ) @ ( esk2_1 @ X14 ) )
& ~ ( epred1_1 @ X14 @ ( epsa @ ( epred1_1 @ X14 ) ) @ ( X14 @ ( epred1_1 @ X14 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_10,plain,
! [X3: $i > $i > $o,X2: $i] :
( ? [X48: $i] : ( X3 @ ( epsa @ X3 ) @ X48 )
| ~ ? [X49: $i] : ( X3 @ X2 @ X49 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X5: ( $i > $i > $o ) > $i] :
~ ( epred1_1 @ X5 @ ( epsa @ ( epred1_1 @ X5 ) ) @ ( X5 @ ( epred1_1 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X9: $i > $i > $o,X3: $i > $i > $o] :
( ( ( epsa @ X3 )
= ( epsa @ X9 ) )
| ( ( ^ [Z0: $i] :
? [X50: $i] : ( X9 @ Z0 @ X50 ) )
!= ( ^ [Z0: $i] :
? [X51: $i] : ( X3 @ Z0 @ X51 ) ) ) ),
inference(ext_sup,[status(thm)],[c_0_8,c_0_8]) ).
thf(c_0_13,plain,
! [X2: $i,X3: $i > $i > $o,X4: $i] :
( ( X3 @ ( epsa @ X3 ) @ ( esk11_1 @ X3 ) )
| ~ ( X3 @ X2 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X5: ( $i > $i > $o ) > $i] : ( epred1_1 @ X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i > $i > $o,X5: ( $i > $i > $o ) > $i] :
( ( ( ^ [Z0: $i] :
? [X52: $i] : ( epred1_1 @ X5 @ Z0 @ X52 ) )
!= ( ^ [Z0: $i] :
? [X53: $i] : ( X3 @ Z0 @ X53 ) ) )
| ~ ( epred1_1 @ X5 @ ( epsa @ X3 ) @ ( X5 @ ( epred1_1 @ X5 ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X5: ( $i > $i > $o ) > $i] : ( epred1_1 @ X5 @ ( epsa @ ( epred1_1 @ X5 ) ) @ ( esk11_1 @ ( epred1_1 @ X5 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYO531^1 : TPTP v8.2.0. Released v5.2.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:55:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best_sine with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best_nonlift with 300s (1) cores
% 0.20/0.50 # Starting lpo4_lambdas_fix with 300s (1) cores
% 0.20/0.50 # ho_unfolding_6 with pid 30519 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_6
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF11-DHHFFSBC
% 0.20/0.50 # partial match(3): HGUSF-FFSF11-SHHFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 151s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # Starting sh3 with 150s (1) cores
% 0.20/0.50 # ho_unfolding_6 with pid 30525 completed with status 0
% 0.20/0.50 # Result found by ho_unfolding_6
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF11-DHHFFSBC
% 0.20/0.50 # partial match(3): HGUSF-FFSF11-SHHFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 5
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 6
% 0.20/0.50 # Removed in clause preprocessing : 2
% 0.20/0.50 # Initial clauses in saturation : 4
% 0.20/0.50 # Processed clauses : 38
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 11
% 0.20/0.50 # ...remaining for further processing : 27
% 0.20/0.50 # Other redundant clauses eliminated : 1
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 159
% 0.20/0.50 # ...of the previous two non-redundant : 140
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 141
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 6
% 0.20/0.50 # Equation resolutions : 2
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 9
% 0.20/0.50 # ...of those cached : 5
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 23
% 0.20/0.50 # Positive orientable unit clauses : 7
% 0.20/0.50 # Positive unorientable unit clauses: 3
% 0.20/0.50 # Negative unit clauses : 4
% 0.20/0.50 # Non-unit-clauses : 9
% 0.20/0.50 # Current number of unprocessed clauses: 105
% 0.20/0.50 # ...number of literals in the above : 199
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 46
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 33
% 0.20/0.50 # Non-unit clause-clause subsumptions : 6
% 0.20/0.50 # Unit Clause-clause subsumption calls : 5
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 64
% 0.20/0.50 # BW rewrite match successes : 24
% 0.20/0.50 # Condensation attempts : 38
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 19104
% 0.20/0.50 # Search garbage collected termcells : 104
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.013 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1788 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.044 s
% 0.20/0.50 # System time : 0.008 s
% 0.20/0.50 # Total time : 0.053 s
% 0.20/0.50 # Maximum resident set size: 1728 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------