TSTP Solution File: SEV018^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV018^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 04:07:24 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 114 ( 8 equ; 0 cnn)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 335 ( 45 ~; 44 |; 19 &; 214 @)
% ( 4 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 1 ^ 49 !; 8 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: ( a > $o ) > $o ).
thf(decl_23,type,
esk1_1: ( a > $o ) > a ).
thf(decl_24,type,
epred2_1: a > a > $o ).
thf(decl_25,type,
epred3_1: ( a > a > $o ) > a > $o ).
thf(decl_26,type,
esk2_1: ( a > a > $o ) > a ).
thf(decl_27,type,
esk3_1: ( a > a > $o ) > a ).
thf(decl_28,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk5_2: a > ( a > a > $o ) > a ).
thf(cTHM262A_pme,conjecture,
! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ? [X3: a] : ( X2 @ X3 ) )
& ! [X4: a] :
? [X2: a > $o] :
( ( X1 @ X2 )
& ( X2 @ X4 )
& ! [X5: a > $o] :
( ( ( X1 @ X5 )
& ( X5 @ X4 ) )
=> ( X5 = X2 ) ) ) )
=> ? [X6: a > a > $o] :
( ( ^ [X7: a > $o] :
( ? [X3: a] : ( X7 @ X3 )
& ! [X4: a] :
( ( X7 @ X4 )
=> ! [X8: a] :
( ( X7 @ X8 )
<=> ( X6 @ X4 @ X8 ) ) ) ) )
= X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM262A_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > $o ) > $o] :
( ( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ? [X3: a] : ( X2 @ X3 ) )
& ! [X4: a] :
? [X2: a > $o] :
( ( X1 @ X2 )
& ( X2 @ X4 )
& ! [X5: a > $o] :
( ( ( X1 @ X5 )
& ( X5 @ X4 ) )
=> ( X5 = X2 ) ) ) )
=> ? [X6: a > a > $o] :
! [X16: a > $o] :
( ( ? [X3: a] : ( X16 @ X3 )
& ! [X4: a] :
( ( X16 @ X4 )
=> ! [X8: a] :
( ( X16 @ X8 )
<=> ( X6 @ X4 @ X8 ) ) ) )
<=> ( X1 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM262A_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X18: a > $o,X20: a,X22: a > $o,X23: a > a > $o,X25: a,X29: a,X30: a] :
( ( ~ ( epred1_0 @ X18 )
| ( X18 @ ( esk1_1 @ X18 ) ) )
& ( epred1_0 @ ( epred2_1 @ X20 ) )
& ( epred2_1 @ X20 @ X20 )
& ( ~ ( epred1_0 @ X22 )
| ~ ( X22 @ X20 )
| ( X22
= ( epred2_1 @ X20 ) ) )
& ( ( epred3_1 @ X23 @ ( esk2_1 @ X23 ) )
| ~ ( epred3_1 @ X23 @ X25 )
| ~ ( epred1_0 @ ( epred3_1 @ X23 ) ) )
& ( ~ ( epred3_1 @ X23 @ ( esk3_1 @ X23 ) )
| ~ ( X23 @ ( esk2_1 @ X23 ) @ ( esk3_1 @ X23 ) )
| ~ ( epred3_1 @ X23 @ X25 )
| ~ ( epred1_0 @ ( epred3_1 @ X23 ) ) )
& ( ( epred3_1 @ X23 @ ( esk3_1 @ X23 ) )
| ( X23 @ ( esk2_1 @ X23 ) @ ( esk3_1 @ X23 ) )
| ~ ( epred3_1 @ X23 @ X25 )
| ~ ( epred1_0 @ ( epred3_1 @ X23 ) ) )
& ( ( epred3_1 @ X23 @ ( esk4_1 @ X23 ) )
| ( epred1_0 @ ( epred3_1 @ X23 ) ) )
& ( ~ ( epred3_1 @ X23 @ X30 )
| ( X23 @ X29 @ X30 )
| ~ ( epred3_1 @ X23 @ X29 )
| ( epred1_0 @ ( epred3_1 @ X23 ) ) )
& ( ~ ( X23 @ X29 @ X30 )
| ( epred3_1 @ X23 @ X30 )
| ~ ( epred3_1 @ X23 @ X29 )
| ( epred1_0 @ ( epred3_1 @ X23 ) ) ) ),
inference(distribute,[status(thm)],[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,negated_conjecture,
! [X3: a,X6: a > a > $o,X4: a] :
( ( X6 @ X4 @ X3 )
| ( epred1_0 @ ( epred3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X3 )
| ~ ( epred3_1 @ X6 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a] :
( ( epred1_0 @ ( epred3_1 @ $neq ) )
| ~ ( epred3_1 @ $neq @ X3 ) ),
inference(er,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3])]) ).
thf(c_0_5,negated_conjecture,
! [X6: a > a > $o] :
( ( epred3_1 @ X6 @ ( esk4_1 @ X6 ) )
| ( epred1_0 @ ( epred3_1 @ X6 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X6: a > a > $o] :
( ( epred3_1 @ X6 @ ( esk2_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X3 )
| ~ ( epred1_0 @ ( epred3_1 @ X6 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
epred1_0 @ ( epred3_1 @ $neq ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > $o] :
( ( X2 @ ( esk1_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X2: a > $o,X3: a] :
( ( X2
= ( epred2_1 @ X3 ) )
| ~ ( epred1_0 @ X2 )
| ~ ( X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: a] :
( ( epred3_1 @ $neq @ ( esk2_1 @ $neq ) )
| ~ ( epred3_1 @ $neq @ X3 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
epred3_1 @ $neq @ ( esk1_1 @ ( epred3_1 @ $neq ) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X3: a,X6: a > a > $o] :
( ~ ( epred3_1 @ X6 @ ( esk3_1 @ X6 ) )
| ~ ( X6 @ ( esk2_1 @ X6 ) @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X3 )
| ~ ( epred1_0 @ ( epred3_1 @ X6 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X3: a] : ( epred1_0 @ ( epred2_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X3: a] :
( ( ( epred3_1 @ $neq )
= ( epred2_1 @ X3 ) )
| ~ ( epred3_1 @ $neq @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
thf(c_0_15,negated_conjecture,
epred3_1 @ $neq @ ( esk2_1 @ $neq ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,plain,
! [X3: a,X6: a > a > $o,X4: a] :
( ( ( epred3_1 @ X6 )
!= ( epred2_1 @ X3 ) )
| ~ ( X6 @ ( esk2_1 @ X6 ) @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X4 ) ),
inference(ext_sup,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,negated_conjecture,
( ( epred2_1 @ ( esk2_1 @ $neq ) )
= ( epred3_1 @ $neq ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X3: a,X6: a > a > $o,X4: a] :
( ( ( epred3_1 @ X6 @ ( esk5_2 @ X3 @ X6 ) )
<~> ( epred2_1 @ X3 @ ( esk5_2 @ X3 @ X6 ) ) )
| ~ ( X6 @ ( esk2_1 @ X6 ) @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X4 ) ),
inference(neg_ext,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X42: a] :
( ( epred2_1 @ ( esk2_1 @ $neq ) @ X42 )
<=> ( epred3_1 @ $neq @ X42 ) ),
inference(arg_cong,[status(thm)],[c_0_17]) ).
thf(c_0_20,plain,
! [X3: a,X6: a > a > $o,X4: a] :
( ~ ( epred3_1 @ X6 @ ( esk5_2 @ X3 @ X6 ) )
| ~ ( epred2_1 @ X3 @ ( esk5_2 @ X3 @ X6 ) )
| ~ ( X6 @ ( esk2_1 @ X6 ) @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ ( esk3_1 @ X6 ) )
| ~ ( epred3_1 @ X6 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X3: a] : ( epred3_1 @ $true @ X3 ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_22,plain,
! [X3: a] :
( ~ ( $true @ ( esk2_1 @ $true ) @ ( esk3_1 @ $true ) )
| ~ ( epred2_1 @ X3 @ ( esk5_2 @ X3 @ $true ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_21])]) ).
thf(c_0_23,plain,
! [X3: a] :
~ ( epred2_1 @ X3 @ ( esk5_2 @ X3 @ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_22])]) ).
thf(c_0_24,negated_conjecture,
! [X3: a] : ( epred2_1 @ ( esk2_1 @ $true ) @ X3 ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_25,plain,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEV018^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 18:43:07 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/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.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.18/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting sh2lt with 1200s (4) cores
% 0.18/0.47 # Starting new_ho_10_unif with 300s (1) cores
% 0.18/0.47 # Starting full_lambda_6 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.47 # Starting ehoh_best3_rw with 300s (1) cores
% 0.18/0.47 # sh2lt with pid 15416 completed with status 0
% 0.18/0.47 # Result found by sh2lt
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.18/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting sh2lt with 1200s (4) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.18/0.47 # Search class: HGHSS-FFSF11-SHHFFMBN
% 0.18/0.47 # partial match(1): HGHSS-FFMF11-SHHFFMBN
% 0.18/0.47 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.18/0.47 # Starting full_lambda_6 with 649s (1) cores
% 0.18/0.47 # Starting sh2lt with 121s (1) cores
% 0.18/0.47 # Starting ho_unfolding_4 with 109s (1) cores
% 0.18/0.47 # Starting full_lambda_5 with 109s (1) cores
% 0.18/0.47 # sh2lt with pid 15425 completed with status 0
% 0.18/0.47 # Result found by sh2lt
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.18/0.47 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting sh2lt with 1200s (4) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.18/0.47 # Search class: HGHSS-FFSF11-SHHFFMBN
% 0.18/0.47 # partial match(1): HGHSS-FFMF11-SHHFFMBN
% 0.18/0.47 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.18/0.47 # Starting full_lambda_6 with 649s (1) cores
% 0.18/0.47 # Starting sh2lt with 121s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 2
% 0.18/0.48 # Removed by relevancy pruning/SinE : 1
% 0.18/0.48 # Initial clauses : 10
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 10
% 0.18/0.48 # Processed clauses : 57
% 0.18/0.48 # ...of these trivial : 1
% 0.18/0.48 # ...subsumed : 2
% 0.18/0.48 # ...remaining for further processing : 54
% 0.18/0.48 # Other redundant clauses eliminated : 4
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 3
% 0.18/0.48 # Generated clauses : 115
% 0.18/0.48 # ...of the previous two non-redundant : 74
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 44
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 1
% 0.18/0.48 # Equation resolutions : 4
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 34
% 0.18/0.48 # ...of those cached : 18
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 35
% 0.18/0.48 # Positive orientable unit clauses : 13
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 2
% 0.18/0.48 # Non-unit-clauses : 20
% 0.18/0.48 # Current number of unprocessed clauses: 37
% 0.18/0.48 # ...number of literals in the above : 105
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 19
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 40
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 14
% 0.18/0.48 # Non-unit clause-clause subsumptions : 2
% 0.18/0.48 # Unit Clause-clause subsumption calls : 25
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 3
% 0.18/0.48 # BW rewrite match successes : 2
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 4738
% 0.18/0.48 # Search garbage collected termcells : 478
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.008 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.010 s
% 0.18/0.48 # Maximum resident set size: 1916 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.026 s
% 0.18/0.48 # System time : 0.008 s
% 0.18/0.48 # Total time : 0.034 s
% 0.18/0.48 # Maximum resident set size: 1728 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------