TSTP Solution File: SYO530^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO530^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 6 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 123 ( 12 ~; 6 |; 2 &; 99 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 17 ^ 15 !; 14 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
epsa: ( $i > $i > $o ) > $i ).
thf(decl_24,type,
epsb: ( $i > $i > $o ) > $i ).
thf(decl_25,type,
epred1_0: $i > $i > $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
epred2_0: $i > $o ).
thf(decl_29,type,
esk3_1: $i > $i ).
thf(epsbd,axiom,
( epsb
= ( ^ [X3: $i > $i > $o] :
( eps
@ ^ [X4: $i] : ( X3 @ ( epsa @ X3 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsbd) ).
thf(epsad,axiom,
( epsa
= ( ^ [X3: $i > $i > $o] :
( eps
@ ^ [X2: $i] :
? [X4: $i] : ( X3 @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsad) ).
thf(conj,conjecture,
! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(c_0_4,plain,
( epsb
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
( Z0
@ ( eps
@ ^ [Z2: $i] :
? [X10: $i] : ( Z0 @ Z2 @ X10 ) )
@ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[epsbd]) ).
thf(c_0_5,plain,
( epsa
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
? [X4: $i] : ( Z0 @ Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[epsad]) ).
thf(c_0_6,plain,
( epsb
= ( ^ [Z0: $i > $i > $o] :
( eps
@ ^ [Z1: $i] :
( Z0
@ ( eps
@ ^ [Z2: $i] :
? [X10: $i] : ( Z0 @ Z2 @ X10 ) )
@ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ ! [X3: $i > $i > $o] :
( ? [X2: $i,X4: $i] : ( X3 @ X2 @ X4 )
=> ( X3
@ ( eps
@ ^ [Z0: $i] :
? [X11: $i] : ( X3 @ Z0 @ X11 ) )
@ ( eps
@ ^ [Z0: $i] :
( X3
@ ( eps
@ ^ [Z1: $i] :
? [X12: $i] : ( X3 @ Z1 @ X12 ) )
@ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_6]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
& ~ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X11: $i] : ( epred1_0 @ Z0 @ X11 ) )
@ ( eps
@ ( epred1_0
@ ( eps
@ ^ [Z0: $i] :
? [X12: $i] : ( epred1_0 @ Z0 @ X12 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_9,plain,
! [X20: $i] :
( ( epred2_0 @ X20 )
<=> ? [X18: $i] : ( epred1_0 @ X20 @ X18 ) ),
introduced(definition) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ ( eps @ epred2_0 ) @ ( eps @ ( epred1_0 @ ( eps @ epred2_0 ) ) ) )
!= $true ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]),c_0_9]),c_0_9]) ).
thf(c_0_11,plain,
! [X16: $i > $o,X17: $i] :
( ~ ( X16 @ X17 )
| ( X16 @ ( eps @ X16 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_12,plain,
! [X22: $i,X24: $i,X25: $i] :
( ( ~ ( epred2_0 @ X22 )
| ( epred1_0 @ X22 @ ( esk3_1 @ X22 ) ) )
& ( ~ ( epred1_0 @ X24 @ X25 )
| ( epred2_0 @ X24 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0 @ ( eps @ epred2_0 ) @ ( eps @ ( epred1_0 @ ( eps @ epred2_0 ) ) ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
! [X2: $i,X4: $i] :
( ( epred2_0 @ X2 )
| ~ ( epred1_0 @ X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i] :
~ ( epred1_0 @ ( eps @ epred2_0 ) @ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
thf(c_0_18,plain,
! [X2: $i] :
( ( epred1_0 @ X2 @ ( esk3_1 @ X2 ) )
| ~ ( epred2_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
epred2_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
~ ( epred2_0 @ ( eps @ epred2_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO530^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 11:04:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting lpo8_s with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.49 # Starting sh1 with 300s (1) cores
% 0.20/0.49 # lpo8_s with pid 12759 completed with status 0
% 0.20/0.49 # Result found by lpo8_s
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting lpo8_s with 1500s (5) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF11-MHSFFSBC
% 0.20/0.49 # partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 811s (1) cores
% 0.20/0.49 # Starting lpo8_s with 151s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 12764 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting lpo8_s with 1500s (5) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF11-MHSFFSBC
% 0.20/0.49 # partial match(3): HHUNF-FFSF11-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 811s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 7
% 0.20/0.49 # Removed by relevancy pruning/SinE : 3
% 0.20/0.49 # Initial clauses : 5
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 5
% 0.20/0.49 # Processed clauses : 14
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 1
% 0.20/0.49 # ...remaining for further processing : 13
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 11
% 0.20/0.49 # ...of the previous two non-redundant : 9
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 6
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 7
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 3
% 0.20/0.49 # Current number of unprocessed clauses: 5
% 0.20/0.49 # ...number of literals in the above : 8
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 6
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 14
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 752
% 0.20/0.49 # Search garbage collected termcells : 230
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1904 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.010 s
% 0.20/0.49 # System time : 0.011 s
% 0.20/0.49 # Total time : 0.021 s
% 0.20/0.49 # Maximum resident set size: 1728 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------