TSTP Solution File: SYO559^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO559^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:48:04 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 51 ( 0 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 76 ( 16 ~; 9 |; 3 &; 44 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 1 ^ 10 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epso: ( $o > $o ) > $o ).
thf(decl_23,type,
epsoo: ( ( $o > $o ) > $o ) > $o > $o ).
thf(choiceaxo,axiom,
! [X1: $o > $o] :
( ? [X2: $o] : ( X1 @ X2 )
=> ( X1 @ ( epso @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceaxo) ).
thf(c,conjecture,
( ( epsoo @ epso @ ~ $true )
=> ( epsoo @ epso @ $true ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
thf(choiceaxoo,axiom,
! [X3: ( $o > $o ) > $o] :
( ? [X4: $o > $o] : ( X3 @ X4 )
=> ( X3 @ ( epsoo @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceaxoo) ).
thf(c_0_3,plain,
! [X9: $o > $o,X10: $o] :
( ~ ( X9 @ X10 )
| ( X9 @ ( epso @ X9 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxo])])])]) ).
thf(c_0_4,negated_conjecture,
~ ( ( ( ~ ~ $true
| ( epsoo @ epso @ $true ) )
& ( ~ $true
| ( epsoo @ epso @ $false ) ) )
=> ( epsoo @ epso @ $true ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[c])]) ).
thf(c_0_5,plain,
! [X1: $o > $o,X2: $o] :
( ( X1 @ ( epso @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( $true
| ( epsoo @ epso @ $true ) )
& ( ~ $true
| ( epsoo @ epso @ $false ) )
& ~ ( epsoo @ epso @ $true ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
thf(c_0_7,plain,
! [X11: ( $o > $o ) > $o,X12: $o > $o] :
( ~ ( X11 @ X12 )
| ( X11 @ ( epsoo @ X11 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxoo])])])]) ).
thf(c_0_8,plain,
~ ( epso @ $not ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5])])]) ).
thf(c_0_9,negated_conjecture,
( ( epsoo @ epso @ ~ $true )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X3: ( $o > $o ) > $o,X1: $o > $o] :
( ( X3 @ ( epsoo @ X3 ) )
| ~ ( X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( epso
@ ^ [Z0: $o] : Z0 ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]),c_0_8,c_0_5])])]) ).
thf(c_0_12,negated_conjecture,
epsoo @ epso @ ~ $true,
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
epso @ ( epsoo @ epso ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( epsoo @ epso @ $true ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SYO559^1 : TPTP v8.2.0. Released v5.2.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 09:26:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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
% 0.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting ehoh_best_sine with 300s (1) cores
% 0.19/0.47 # Starting ehoh_best_nonlift with 300s (1) cores
% 0.19/0.47 # Starting lpo4_lambdas_fix with 300s (1) cores
% 0.19/0.47 # ehoh_best_nonlift with pid 21465 completed with status 0
% 0.19/0.47 # Result found by ehoh_best_nonlift
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting ehoh_best_sine with 300s (1) cores
% 0.19/0.47 # Starting ehoh_best_nonlift with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUNF-FFSF00-SHHFFMBC
% 0.19/0.47 # partial match(2): HGUNF-FFSF00-SHHFFMBN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting ehoh_best6_lambda with 163s (1) cores
% 0.19/0.47 # ehoh_best6_lambda with pid 21468 completed with status 0
% 0.19/0.47 # Result found by ehoh_best6_lambda
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSCHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.19/0.47 # Starting ehoh_best_sine with 300s (1) cores
% 0.19/0.47 # Starting ehoh_best_nonlift with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUNF-FFSF00-SHHFFMBC
% 0.19/0.47 # partial match(2): HGUNF-FFSF00-SHHFFMBN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting ehoh_best6_lambda with 163s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 5
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 7
% 0.19/0.47 # Removed in clause preprocessing : 3
% 0.19/0.47 # Initial clauses in saturation : 4
% 0.19/0.47 # Processed clauses : 13
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 1
% 0.19/0.47 # ...remaining for further processing : 11
% 0.19/0.47 # Other redundant clauses eliminated : 1
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 20
% 0.19/0.47 # ...of the previous two non-redundant : 13
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 3
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 1
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 2
% 0.19/0.47 # ...of those cached : 1
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 7
% 0.19/0.47 # Positive orientable unit clauses : 3
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 2
% 0.19/0.47 # Non-unit-clauses : 2
% 0.19/0.47 # Current number of unprocessed clauses: 8
% 0.19/0.47 # ...number of literals in the above : 14
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 4
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 0
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 795
% 0.19/0.47 # Search garbage collected termcells : 95
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.002 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1776 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.003 s
% 0.19/0.47 # Total time : 0.007 s
% 0.19/0.47 # Maximum resident set size: 1728 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------