TSTP Solution File: SYO539^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO539^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:00 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 18 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 51 ( 33 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 89 ( 21 ~; 17 |; 25 &; 25 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 29 ( 16 ^ 12 !; 1 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
if: $o > $i > $i > $i ).
thf(decl_24,type,
epred1_0: $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(ifd,axiom,
( if
= ( ^ [X3: $o,X2: $i,X4: $i] :
( eps
@ ^ [X5: $i] :
( ( X3
& ( X5 = X2 ) )
| ( ~ X3
& ( X5 = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifd) ).
thf(conj,conjecture,
! [X3: $o,X2: $i,X4: $i] :
( ( ( if @ X3 @ X2 @ X4 )
= X2 )
| ( ( if @ X3 @ X2 @ X4 )
= X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceax) ).
thf(c_0_3,plain,
( if
= ( ^ [Z0: $o,Z1: $i,Z2: $i] :
( eps
@ ^ [Z3: $i] :
( ( Z0
& ( Z3 = Z1 ) )
| ( ~ Z0
& Z3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ifd]) ).
thf(c_0_4,negated_conjecture,
~ ! [X3: $o,X2: $i,X4: $i] :
( ( ( eps
@ ^ [Z0: $i] :
( ( X3
& ( Z0 = X2 ) )
| ( ~ X3
& ( Z0 = X4 ) ) ) )
= X2 )
| ( ( eps
@ ^ [Z0: $i] :
( ( X3
& ( Z0 = X2 ) )
| ( ~ X3
& ( Z0 = X4 ) ) ) )
= X4 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
!= esk1_0 )
& ( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
!= esk2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_6,plain,
! [X11: $i > $o,X12: $i] :
( ~ ( X11 @ X12 )
| ( X11 @ ( eps @ X11 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_7,negated_conjecture,
( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
!= esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( epred1_0
& ( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
= esk1_0 ) )
| ( ~ epred1_0
& ( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
= esk2_0 ) )
| ~ ( ( epred1_0
& ( X2 = esk1_0 ) )
| ( ~ epred1_0
& ( X2 = esk2_0 ) ) ) ),
inference(choice_inst,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( eps
@ ^ [Z0: $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk2_0 ) ) ) )
!= esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
~ epred1_0,
inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9]),c_0_10]),c_0_7])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9]),c_0_10]),c_0_7])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO539^1 : TPTP v8.2.0. Released v5.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 09:26:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSSCSFA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.17/0.45 # Starting ho_unfolding_6 with 300s (1) cores
% 0.17/0.45 # Starting sh4l with 300s (1) cores
% 0.17/0.45 # ehoh_best8_lambda with pid 21853 completed with status 0
% 0.17/0.45 # Result found by ehoh_best8_lambda
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSSCSFA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSF-FFSF11-MSFFFSBC
% 0.17/0.45 # partial match(3): HGUSF-FFSF11-SSFFFSBN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_14 with 163s (1) cores
% 0.17/0.45 # new_ho_14 with pid 21856 completed with status 0
% 0.17/0.45 # Result found by new_ho_14
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSSCSFA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSF-FFSF11-MSFFFSBC
% 0.17/0.45 # partial match(3): HGUSF-FFSF11-SSFFFSBN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_14 with 163s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 5
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 5
% 0.17/0.45 # Removed in clause preprocessing : 2
% 0.17/0.45 # Initial clauses in saturation : 3
% 0.17/0.45 # Processed clauses : 10
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 1
% 0.17/0.45 # ...remaining for further processing : 8
% 0.17/0.45 # Other redundant clauses eliminated : 4
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 16
% 0.17/0.45 # ...of the previous two non-redundant : 8
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 0
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 4
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 0
% 0.17/0.45 # ...of those cached : 0
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 4
% 0.17/0.45 # Positive orientable unit clauses : 0
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 3
% 0.17/0.45 # Non-unit-clauses : 1
% 0.17/0.45 # Current number of unprocessed clauses: 4
% 0.17/0.45 # ...number of literals in the above : 7
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 4
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 1
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 1104
% 0.17/0.45 # Search garbage collected termcells : 89
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1748 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.005 s
% 0.17/0.45 # Total time : 0.007 s
% 0.17/0.45 # Maximum resident set size: 1708 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------