TSTP Solution File: SYO534^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO534^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:59 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 49 ( 22 unt; 13 typ; 0 def)
% Number of atoms : 49 ( 12 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 254 ( 18 ~; 14 |; 3 &; 214 @)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 129 ( 129 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 76 ( 10 ^ 47 !; 19 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
eps: ( $i > $o ) > $i ).
thf(decl_23,type,
epsa: ( $i > $i > $i > $o ) > $i ).
thf(decl_24,type,
epsb: ( $i > $i > $i > $o ) > $i ).
thf(decl_25,type,
epsc: ( $i > $i > $i > $o ) > $i ).
thf(decl_26,type,
epred1_0: $i > $i > $i > $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
epred2_1: ( $i > $i > $i > $o ) > $i > $o ).
thf(decl_31,type,
epred3_1: ( $i > $i > $i > $o ) > $i > $o ).
thf(decl_32,type,
esk4_2: $i > ( $i > $i > $i > $o ) > $i ).
thf(decl_33,type,
esk5_2: $i > ( $i > $i > $i > $o ) > $i ).
thf(decl_34,type,
esk6_2: $i > ( $i > $i > $i > $o ) > $i ).
thf(choiceax,axiom,
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ( X1 @ ( eps @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(epscd,axiom,
( epsc
= ( ^ [X3: $i > $i > $i > $o] :
( eps
@ ^ [X5: $i] : ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epscd) ).
thf(conj,conjecture,
! [X3: $i > $i > $i > $o] :
( ? [X2: $i,X4: $i,X5: $i] : ( X3 @ X2 @ X4 @ X5 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) @ ( epsc @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(epsbd,axiom,
( epsb
= ( ^ [X3: $i > $i > $i > $o] :
( eps
@ ^ [X4: $i] :
? [X5: $i] : ( X3 @ ( epsa @ X3 ) @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsbd) ).
thf(epsad,axiom,
( epsa
= ( ^ [X3: $i > $i > $i > $o] :
( eps
@ ^ [X2: $i] :
? [X4: $i,X5: $i] : ( X3 @ X2 @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsad) ).
thf(c_0_5,plain,
! [X15: $i > $o,X16: $i] :
( ~ ( X15 @ X16 )
| ( X15 @ ( eps @ X15 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])]) ).
thf(c_0_6,plain,
! [X37: $i,X38: $i > $i > $i > $o,X40: $i,X41: $i > $i > $i > $o,X42: $i] :
( ( ~ ( epred3_1 @ X38 @ X37 )
| ( X38 @ ( epsa @ X38 ) @ X37 @ ( esk6_2 @ X37 @ X38 ) ) )
& ( ~ ( X41 @ ( epsa @ X41 ) @ X40 @ X42 )
| ( epred3_1 @ X41 @ X40 ) ) ),
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_7,plain,
! [X14: $i > $i > $i > $o] :
( ( epsc @ X14 )
= ( eps @ ( X14 @ ( epsa @ X14 ) @ ( epsb @ X14 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[epscd])])]) ).
thf(c_0_8,negated_conjecture,
~ ! [X3: $i > $i > $i > $o] :
( ? [X2: $i,X4: $i,X5: $i] : ( X3 @ X2 @ X4 @ X5 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) @ ( epsc @ X3 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_9,plain,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( eps @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
! [X3: $i > $i > $i > $o,X2: $i] :
( ( X3 @ ( epsa @ X3 ) @ X2 @ ( esk6_2 @ X2 @ X3 ) )
| ~ ( epred3_1 @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X19: $i > $i > $i > $o] :
( ( epsc @ X19 )
= ( eps @ ( X19 @ ( epsa @ X19 ) @ ( epsb @ X19 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
! [X29: $i,X30: $i > $i > $i > $o,X33: $i,X34: $i > $i > $i > $o,X35: $i,X36: $i] :
( ( ~ ( epred2_1 @ X30 @ X29 )
| ( X30 @ X29 @ ( esk4_2 @ X29 @ X30 ) @ ( esk5_2 @ X29 @ X30 ) ) )
& ( ~ ( X34 @ X33 @ X35 @ X36 )
| ( epred2_1 @ X34 @ X33 ) ) ),
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,plain,
! [X13: $i > $i > $i > $o] :
( ( epsb @ X13 )
= ( eps
@ ^ [Z0: $i] :
? [X5: $i] : ( X13 @ ( epsa @ X13 ) @ Z0 @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[epsbd])]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 @ esk3_0 )
& ~ ( epred1_0 @ ( epsa @ epred1_0 ) @ ( epsb @ epred1_0 ) @ ( epsc @ epred1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
thf(c_0_15,plain,
! [X12: $i > $i > $i > $o] :
( ( epsa @ X12 )
= ( eps
@ ^ [Z0: $i] :
? [X4: $i,X5: $i] : ( X12 @ Z0 @ X4 @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[epsad])]) ).
thf(c_0_16,plain,
! [X3: $i > $i > $i > $o,X2: $i] :
( ( X3 @ ( epsa @ X3 ) @ X2 @ ( eps @ ( X3 @ ( epsa @ X3 ) @ X2 ) ) )
| ~ ( epred3_1 @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_17,plain,
! [X3: $i > $i > $i > $o] :
( ( epsc @ X3 )
= ( eps @ ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,plain,
! [X2: $i,X3: $i > $i > $i > $o,X4: $i] :
( ( epred3_1 @ X3 @ X2 )
| ~ ( X3 @ ( epsa @ X3 ) @ X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_19,plain,
! [X3: $i > $i > $i > $o,X2: $i] :
( ( X3 @ X2 @ ( esk4_2 @ X2 @ X3 ) @ ( esk5_2 @ X2 @ X3 ) )
| ~ ( epred2_1 @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_20,plain,
! [X18: $i > $i > $i > $o] :
( ( epsb @ X18 )
= ( eps
@ ^ [Z0: $i] :
? [X5: $i] : ( X18 @ ( epsa @ X18 ) @ Z0 @ X5 ) ) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
thf(c_0_21,plain,
! [X28: $i,X3: $i > $i > $i > $o] :
( ( epred3_1 @ X3 @ X28 )
<=> ? [X27: $i] : ( X3 @ ( epsa @ X3 ) @ X28 @ X27 ) ),
introduced(definition) ).
thf(c_0_22,plain,
! [X2: $i,X3: $i > $i > $i > $o,X4: $i,X5: $i] :
( ( epred2_1 @ X3 @ X2 )
| ~ ( X3 @ X2 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_24,plain,
! [X17: $i > $i > $i > $o] :
( ( epsa @ X17 )
= ( eps
@ ^ [Z0: $i] :
? [X4: $i,X5: $i] : ( X17 @ Z0 @ X4 @ X5 ) ) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
thf(c_0_25,plain,
! [X26: $i,X3: $i > $i > $i > $o] :
( ( epred2_1 @ X3 @ X26 )
<=> ? [X24: $i,X25: $i] : ( X3 @ X26 @ X24 @ X25 ) ),
introduced(definition) ).
thf(c_0_26,negated_conjecture,
~ ( epred1_0 @ ( epsa @ epred1_0 ) @ ( epsb @ epred1_0 ) @ ( epsc @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_27,plain,
! [X3: $i > $i > $i > $o] :
( ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) @ ( epsc @ X3 ) )
| ~ ( epred3_1 @ X3 @ ( epsb @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_28,plain,
! [X3: $i > $i > $i > $o] :
( ( epred3_1 @ X3 @ ( esk4_2 @ ( epsa @ X3 ) @ X3 ) )
| ~ ( epred2_1 @ X3 @ ( epsa @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_29,plain,
! [X3: $i > $i > $i > $o] :
( ( epsb @ X3 )
= ( eps @ ( epred3_1 @ X3 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_20]),c_0_21]) ).
thf(c_0_30,negated_conjecture,
epred2_1 @ epred1_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_31,plain,
! [X3: $i > $i > $i > $o] :
( ( epsa @ X3 )
= ( eps @ ( epred2_1 @ X3 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_24]),c_0_25]) ).
thf(c_0_32,negated_conjecture,
~ ( epred3_1 @ epred1_0 @ ( epsb @ epred1_0 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,plain,
! [X3: $i > $i > $i > $o] :
( ( epred3_1 @ X3 @ ( epsb @ X3 ) )
| ~ ( epred2_1 @ X3 @ ( epsa @ X3 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28]),c_0_29]) ).
thf(c_0_34,negated_conjecture,
epred2_1 @ epred1_0 @ ( epsa @ epred1_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_30]),c_0_31]) ).
thf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO534^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n020.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.34 % DateTime : Mon May 20 09:45:08 EDT 2024
% 0.13/0.34 % 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.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo8_s with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting sh1 with 300s (1) cores
% 0.19/0.48 # sh1 with pid 22903 completed with status 0
% 0.19/0.48 # Result found by sh1
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo8_s with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting sh1 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUSS-FFSF21-MHSFFMBC
% 0.19/0.48 # partial match(1): HHUSS-FFSF21-MHHFFMBC
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 22911 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSMCHSA.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo8_s with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting sh1 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUSS-FFSF21-MHSFFMBC
% 0.19/0.48 # partial match(1): HHUSS-FFSF21-MHHFFMBC
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 9
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 14
% 0.19/0.48 # Removed in clause preprocessing : 4
% 0.19/0.48 # Initial clauses in saturation : 10
% 0.19/0.48 # Processed clauses : 35
% 0.19/0.48 # ...of these trivial : 1
% 0.19/0.48 # ...subsumed : 4
% 0.19/0.48 # ...remaining for further processing : 30
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 28
% 0.19/0.48 # ...of the previous two non-redundant : 18
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 28
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 9
% 0.19/0.48 # ...of those cached : 3
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 20
% 0.19/0.48 # Positive orientable unit clauses : 7
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 11
% 0.19/0.48 # Current number of unprocessed clauses: 3
% 0.19/0.48 # ...number of literals in the above : 6
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 10
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 34
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 19
% 0.19/0.48 # Non-unit clause-clause subsumptions : 4
% 0.19/0.48 # Unit Clause-clause subsumption calls : 1
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 8
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 35
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1417
% 0.19/0.48 # Search garbage collected termcells : 309
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1880 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.011 s
% 0.19/0.48 # Maximum resident set size: 1724 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------