TSTP Solution File: SYO241^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO241^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:45:14 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 51 ( 22 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 115 ( 21 ~; 11 |; 10 &; 67 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 3 ^ 20 !; 6 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: ( $i > $o ) > $i ).
thf(decl_23,type,
epred1_0: $i > $o ).
thf(decl_24,type,
epred2_0: $i > $o ).
thf(decl_25,type,
epred3_1: $i > $i > $o ).
thf(cTHM143_EXPAND,conjecture,
! [X1: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
=> ~ ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( ( X1
@ ^ [X5: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( X5
= ( X1 @ X6 ) ) ) )
= ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM143_EXPAND) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
=> ~ ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( ( X1
@ ^ [Z0: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( Z0
= ( X1 @ X6 ) ) ) )
= ( X1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM143_EXPAND])]) ).
thf(c_0_2,negated_conjecture,
! [X12: $i > $o,X13: $i > $o] :
( ( ( ( esk1_0 @ X12 )
!= ( esk1_0 @ X13 ) )
| ( X12 = X13 ) )
& ~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) )
& ( ( esk1_0
@ ^ [Z0: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( esk1_0 @ X6 ) )
& ( Z0
= ( esk1_0 @ X6 ) ) ) )
= ( esk1_0 @ epred1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,plain,
! [X16: $i] :
( ( epred2_0 @ X16 )
<=> ? [X15: $i > $o] :
( ~ ( X15 @ ( esk1_0 @ X15 ) )
& ( X16
= ( esk1_0 @ X15 ) ) ) ),
introduced(definition) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $o,X3: $i > $o] :
( ( X2 = X3 )
| ( ( esk1_0 @ X2 )
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( esk1_0 @ epred2_0 )
= ( esk1_0 @ epred1_0 ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i > $o] :
( ( X2 = epred1_0 )
| ( ( esk1_0 @ X2 )
!= ( esk1_0 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,plain,
! [X17: $i,X19: $i,X20: $i > $o] :
( ( ~ ( epred3_1 @ X17 @ ( esk1_0 @ ( epred3_1 @ X17 ) ) )
| ~ ( epred2_0 @ X17 ) )
& ( ( X17
= ( esk1_0 @ ( epred3_1 @ X17 ) ) )
| ~ ( epred2_0 @ X17 ) )
& ( ( X20 @ ( esk1_0 @ X20 ) )
| ( X19
!= ( esk1_0 @ X20 ) )
| ( epred2_0 @ X19 ) ) ),
inference(distribute,[status(thm)],[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_8,negated_conjecture,
epred1_0 = epred2_0,
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X5: $i,X2: $i > $o] :
( ( X2 @ ( esk1_0 @ X2 ) )
| ( epred2_0 @ X5 )
| ( X5
!= ( esk1_0 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X23: $i] :
( ( epred1_0 @ X23 )
<=> ( epred2_0 @ X23 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X2: $i > $o] :
( ( epred2_0 @ ( esk1_0 @ X2 ) )
| ( X2 @ ( esk1_0 @ X2 ) ) ),
inference(er,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0 @ ( esk1_0 @ epred2_0 ) ),
inference(rw,[status(thm)],[c_0_10,c_0_5]) ).
thf(c_0_14,negated_conjecture,
! [X5: $i] :
( ( epred1_0 @ X5 )
| ~ ( epred2_0 @ X5 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
epred2_0 @ ( esk1_0 @ epred2_0 ),
inference(ef,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO241^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n025.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon May 20 10:32:23 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting sh2lt with 1200s (4) cores
% 0.19/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.19/0.49 # post_as_ho1 with pid 13130 completed with status 0
% 0.19/0.49 # Result found by post_as_ho1
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting sh2lt with 1200s (4) cores
% 0.19/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGHSF-FFSF00-SHHFFSBN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # new_ho_10 with pid 13137 completed with status 0
% 0.19/0.49 # Result found by new_ho_10
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting sh2lt with 1200s (4) cores
% 0.19/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGHSF-FFSF00-SHHFFSBN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 1
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 6
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 6
% 0.19/0.49 # Processed clauses : 24
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 2
% 0.19/0.49 # ...remaining for further processing : 22
% 0.19/0.49 # Other redundant clauses eliminated : 5
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 29
% 0.19/0.49 # ...of the previous two non-redundant : 20
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 12
% 0.19/0.49 # Factorizations : 2
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 8
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 6
% 0.19/0.49 # ...of those cached : 3
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 11
% 0.19/0.49 # Positive orientable unit clauses : 2
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 8
% 0.19/0.49 # Current number of unprocessed clauses: 7
% 0.19/0.49 # ...number of literals in the above : 15
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 10
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 10
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 10
% 0.19/0.49 # Non-unit clause-clause subsumptions : 2
% 0.19/0.49 # Unit Clause-clause subsumption calls : 3
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 24
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 978
% 0.19/0.49 # Search garbage collected termcells : 224
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.004 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.006 s
% 0.19/0.49 # Maximum resident set size: 1788 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.009 s
% 0.19/0.49 # Maximum resident set size: 1708 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------