TSTP Solution File: SYO547^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO547^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:01 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 0 avg)
% Number of connectives : 49 ( 14 ~; 2 |; 1 &; 29 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 7 ^ 8 !; 3 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
epscomp: ( $i > $o ) > $i ).
thf(decl_24,type,
epred1_0: $i > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(epscompd,axiom,
( epscomp
= ( ^ [X1: $i > $o] :
( eps
@ ^ [X2: $i] :
~ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epscompd) ).
thf(choicecomp,conjecture,
! [X1: $i > $o] :
( ? [X2: $i] :
~ ( X1 @ X2 )
=> ~ ( X1 @ ( epscomp @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choicecomp) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(c_0_3,plain,
( epscomp
= ( ^ [Z0: $i > $o] :
( eps
@ ^ [Z1: $i] :
~ ( Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[epscompd]) ).
thf(c_0_4,negated_conjecture,
~ ! [X1: $i > $o] :
( ? [X2: $i] :
~ ( X1 @ X2 )
=> ~ ( X1
@ ( eps
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[choicecomp]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
& ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) ) ),
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,
! [X9: $i > $o,X10: $i] :
( ~ ( X9 @ X10 )
| ( X9 @ ( eps @ X9 ) ) ),
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,
( epred1_0
@ ( eps
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) ),
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,
~ ( epred1_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i] : ( epred1_0 @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7,c_0_8]),c_0_7])]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SYO547^1 : TPTP v8.2.0. Released v5.2.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n004.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 10:05:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running higher-order theorem proving
% 0.15/0.41 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.15/0.42 # Version: 3.1.0-ho
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_2 with 300s (1) cores
% 0.15/0.42 # sh5l with pid 25089 completed with status 0
% 0.15/0.42 # Result found by sh5l
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: HHUNF-FFSF11-MHSFFSBC
% 0.15/0.42 # partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting ho_unfolding_3 with 181s (1) cores
% 0.15/0.42 # ho_unfolding_3 with pid 25092 completed with status 0
% 0.15/0.42 # Result found by ho_unfolding_3
% 0.15/0.42 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: HHUNF-FFSF11-MHSFFSBC
% 0.15/0.42 # partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting ho_unfolding_3 with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 5
% 0.15/0.42 # Removed by relevancy pruning/SinE : 2
% 0.15/0.42 # Initial clauses : 3
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 3
% 0.15/0.42 # Processed clauses : 7
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 7
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 2
% 0.15/0.42 # Generated clauses : 5
% 0.15/0.42 # ...of the previous two non-redundant : 4
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 2
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 3
% 0.15/0.42 # ...of those cached : 0
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 2
% 0.15/0.42 # Positive orientable unit clauses : 1
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 0
% 0.15/0.42 # Non-unit-clauses : 1
% 0.15/0.42 # Current number of unprocessed clauses: 3
% 0.15/0.42 # ...number of literals in the above : 4
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 5
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42 # Non-unit clause-clause subsumptions : 0
% 0.15/0.42 # Unit Clause-clause subsumption calls : 0
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 2
% 0.15/0.42 # BW rewrite match successes : 2
% 0.15/0.42 # Condensation attempts : 7
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 367
% 0.15/0.42 # Search garbage collected termcells : 88
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.002 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.004 s
% 0.15/0.42 # Maximum resident set size: 1804 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.007 s
% 0.15/0.42 # Maximum resident set size: 1704 pages
% 0.15/0.42 % E---3.1 exiting
% 0.30/0.42 % E exiting
%------------------------------------------------------------------------------