TSTP Solution File: SYO537^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO537^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 40 ( 19 unt; 9 typ; 0 def)
% Number of atoms : 45 ( 12 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 163 ( 13 ~; 8 |; 2 &; 136 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 147 ( 147 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 55 ( 8 ^ 38 !; 9 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(decl_23,type,
epsa: ( ( $i > $i ) > ( $i > $i ) > $o ) > $i > $i ).
thf(decl_24,type,
epsb: ( ( $i > $i ) > ( $i > $i ) > $o ) > $i > $i ).
thf(decl_25,type,
epred1_0: ( $i > $i ) > ( $i > $i ) > $o ).
thf(decl_26,type,
esk1_0: $i > $i ).
thf(decl_27,type,
esk2_0: $i > $i ).
thf(decl_28,type,
esk3_1: ( $i > $i ) > $i > $i ).
thf(decl_29,type,
epred2_1: ( ( $i > $i ) > ( $i > $i ) > $o ) > ( $i > $i ) > $o ).
thf(decl_30,type,
esk4_2: ( $i > $i ) > ( ( $i > $i ) > ( $i > $i ) > $o ) > $i > $i ).
thf(epsbd,axiom,
( epsb
= ( ^ [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( epsii
@ ^ [X4: $i > $i] : ( X3 @ ( epsa @ X3 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsbd) ).
thf(epsad,axiom,
( epsa
= ( ^ [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( epsii
@ ^ [X2: $i > $i] :
? [X4: $i > $i] : ( X3 @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsad) ).
thf(conj,conjecture,
! [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ? [X2: $i > $i,X4: $i > $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(choiceaxii,axiom,
! [X1: ( $i > $i ) > $o] :
( ? [X2: $i > $i] : ( X1 @ X2 )
=> ( X1 @ ( epsii @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceaxii) ).
thf(c_0_4,plain,
! [X11: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsb @ X11 )
= ( epsii @ ( X11 @ ( epsa @ X11 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[epsbd])])]) ).
thf(c_0_5,plain,
! [X10: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsa @ X10 )
= ( epsii
@ ^ [Z0: $i > $i] :
? [X4: $i > $i] : ( X10 @ Z0 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[epsad])]) ).
thf(c_0_6,negated_conjecture,
~ ! [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ? [X2: $i > $i,X4: $i > $i] : ( X3 @ X2 @ X4 )
=> ( X3 @ ( epsa @ X3 ) @ ( epsb @ X3 ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_7,plain,
! [X15: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsb @ X15 )
= ( epsii @ ( X15 @ ( epsa @ X15 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X14: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsa @ X14 )
= ( epsii
@ ^ [Z0: $i > $i] :
? [X4: $i > $i] : ( X14 @ Z0 @ X4 ) ) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X21: $i > $i,X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epred2_1 @ X3 @ X21 )
<=> ? [X19: $i > $i] : ( X3 @ X21 @ ( esk3_1 @ X19 ) ) ),
introduced(definition) ).
thf(c_0_10,plain,
! [X20: $i,X19: $i > $i] :
( ( esk3_1 @ X19 @ X20 )
= ( X19 @ X20 ) ),
introduced(definition) ).
thf(c_0_11,plain,
! [X24: $i > $i,X25: ( $i > $i ) > ( $i > $i ) > $o,X27: $i > $i,X28: ( $i > $i ) > ( $i > $i ) > $o,X29: $i > $i] :
( ( ~ ( epred2_1 @ X25 @ X24 )
| ( X25 @ X24 @ ( esk3_1 @ ( esk4_2 @ X24 @ X25 ) ) ) )
& ( ~ ( X28 @ X27 @ ( esk3_1 @ X29 ) )
| ( epred2_1 @ X28 @ X27 ) ) ),
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_12,plain,
! [X22: $i,X23: $i > $i] :
( ( esk3_1 @ X23 @ X22 )
= ( X23 @ X22 ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
& ~ ( epred1_0 @ ( epsa @ epred1_0 ) @ ( epsb @ epred1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_14,plain,
! [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsb @ X3 )
= ( epsii @ ( X3 @ ( epsa @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,plain,
! [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsa @ X3 )
= ( epsii @ ( epred2_1 @ X3 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_16,plain,
! [X2: $i > $i,X3: ( $i > $i ) > ( $i > $i ) > $o,X4: $i > $i] :
( ( epred2_1 @ X3 @ X2 )
| ~ ( X3 @ X2 @ ( esk3_1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X2: $i > $i,X20: $i] :
( ( esk3_1 @ X2 @ X20 )
= ( X2 @ X20 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
~ ( epred1_0 @ ( epsa @ epred1_0 ) @ ( epsb @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
! [X3: ( $i > $i ) > ( $i > $i ) > $o] :
( ( epsb @ X3 )
= ( epsii @ ( X3 @ ( epsii @ ( epred2_1 @ X3 ) ) ) ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X12: ( $i > $i ) > $o,X13: $i > $i] :
( ~ ( X12 @ X13 )
| ( X12 @ ( epsii @ X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxii])])])]) ).
thf(c_0_21,plain,
! [X2: $i > $i,X3: ( $i > $i ) > ( $i > $i ) > $o,X4: $i > $i] :
( ( epred2_1 @ X3 @ X2 )
| ~ ( X3 @ X2
@ ^ [Z0: $i] : ( X4 @ Z0 ) ) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_23,negated_conjecture,
~ ( epred1_0 @ ( epsii @ ( epred2_1 @ epred1_0 ) ) @ ( epsii @ ( epred1_0 @ ( epsii @ ( epred2_1 @ epred1_0 ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_19]) ).
thf(c_0_24,plain,
! [X1: ( $i > $i ) > $o,X2: $i > $i] :
( ( X1 @ ( epsii @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
! [X3: ( $i > $i ) > ( $i > $i ) > $o,X2: $i > $i] :
( ( X3 @ X2 @ ( esk3_1 @ ( esk4_2 @ X2 @ X3 ) ) )
| ~ ( epred2_1 @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_26,negated_conjecture,
epred2_1 @ epred1_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i > $i] :
~ ( epred1_0 @ ( epsii @ ( epred2_1 @ epred1_0 ) ) @ X2 ),
inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_23,c_0_24]),c_0_23]) ).
thf(c_0_28,plain,
! [X3: ( $i > $i ) > ( $i > $i ) > $o,X2: $i > $i] :
( ( X3 @ X2
@ ^ [Z0: $i] : ( esk4_2 @ X2 @ X3 @ Z0 ) )
| ~ ( epred2_1 @ X3 @ X2 ) ),
inference(rw,[status(thm)],[c_0_25,c_0_17]) ).
thf(c_0_29,negated_conjecture,
epred2_1 @ epred1_0 @ ( epsii @ ( epred2_1 @ epred1_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO537^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:09:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # ho_unfolding_3 with pid 29207 completed with status 0
% 0.20/0.48 # Result found by ho_unfolding_3
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNF-FFSF22-MHHFFMBC
% 0.20/0.48 # partial match(3): HHUSS-FFSF21-MHHFFMBC
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.20/0.48 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.48 # new_ho_10 with pid 29214 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSMCHHA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNF-FFSF22-MHHFFMBC
% 0.20/0.48 # partial match(3): HHUSS-FFSF21-MHHFFMBC
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 7
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 11
% 0.20/0.48 # Removed in clause preprocessing : 6
% 0.20/0.48 # Initial clauses in saturation : 5
% 0.20/0.48 # Processed clauses : 15
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 14
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 13
% 0.20/0.48 # ...of the previous two non-redundant : 7
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 9
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 4
% 0.20/0.48 # ...of those cached : 1
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 8
% 0.20/0.48 # Positive orientable unit clauses : 4
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 3
% 0.20/0.48 # Current number of unprocessed clauses: 2
% 0.20/0.48 # ...number of literals in the above : 4
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 9
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 15
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1201
% 0.20/0.48 # Search garbage collected termcells : 207
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.005 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1844 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.013 s
% 0.20/0.48 # System time : 0.012 s
% 0.20/0.48 # Total time : 0.025 s
% 0.20/0.48 # Maximum resident set size: 1728 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------