TSTP Solution File: SEV085^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV085^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:33 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 53 ( 8 equ; 0 cnn)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 167 ( 21 ~; 23 |; 10 &; 110 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 90 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 ^ 40 !; 10 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_23,type,
epred2_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_24,type,
epred3_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_25,type,
epred4_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(cTHM120_2_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X2: $i > $o,X3: $i > $o] : ( X1 @ X2 @ X3 )
& ? [X4: $i > $o,X5: $i > $o] :
~ ( X1 @ X4 @ X5 )
& ! [X6: $i > $o] : ( X1 @ X6 @ X6 )
& ! [X6: $i > $o,X7: $i > $o,X8: $i > $o] :
( ( ( X1 @ X6 @ X7 )
& ( X1 @ X7 @ X8 ) )
=> ( X1 @ X6 @ X8 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM120_2_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X2: $i > $o,X3: $i > $o] : ( X1 @ X2 @ X3 )
& ? [X4: $i > $o,X5: $i > $o] :
~ ( X1 @ X4 @ X5 )
& ! [X6: $i > $o] : ( X1 @ X6 @ X6 )
& ! [X6: $i > $o,X7: $i > $o,X8: $i > $o] :
( ( ( X1 @ X6 @ X7 )
& ( X1 @ X7 @ X8 ) )
=> ( X1 @ X6 @ X8 ) ) ),
inference(assume_negation,[status(cth)],[cTHM120_2_pme]) ).
thf(c_0_2,negated_conjecture,
! [X18: ( $i > $o ) > ( $i > $o ) > $o,X19: $i > $o,X20: $i > $o,X21: $i > $o,X22: $i > $o] :
( ( ( X18 @ ( epred2_1 @ X18 ) @ ( epred3_1 @ X18 ) )
| ~ ( X18 @ X19 @ X20 )
| ( X18 @ X21 @ X22 )
| ~ ( X18 @ ( epred1_1 @ X18 ) @ ( epred1_1 @ X18 ) ) )
& ( ( X18 @ ( epred3_1 @ X18 ) @ ( epred4_1 @ X18 ) )
| ~ ( X18 @ X19 @ X20 )
| ( X18 @ X21 @ X22 )
| ~ ( X18 @ ( epred1_1 @ X18 ) @ ( epred1_1 @ X18 ) ) )
& ( ~ ( X18 @ ( epred2_1 @ X18 ) @ ( epred4_1 @ X18 ) )
| ~ ( X18 @ X19 @ X20 )
| ( X18 @ X21 @ X22 )
| ~ ( X18 @ ( epred1_1 @ X18 ) @ ( epred1_1 @ X18 ) ) ) ),
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,
! [X5: $i > $o,X4: $i > $o,X3: $i > $o,X2: $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ X4 @ X5 )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ X2 @ X3 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X5: $i > $o,X4: $i > $o,X3: $i > $o,X2: $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ( X1 @ X4 @ X5 )
| ~ ( X1 @ X2 @ X3 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i > $o,X3: $i > $o] :
( ( X2 = X3 )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ) ),
inference(er,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3])]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i > $o,X3: $i > $o] :
( ( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) )
| ( X2 = X3 ) ),
inference(er,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_4])]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i > $o,X3: $i > $o,X29: $i] :
( ( ( X2 @ X29 )
<=> ( X3 @ X29 ) )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X5: $i > $o,X4: $i > $o,X3: $i > $o,X2: $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( X1 @ X4 @ X5 )
| ~ ( X1 @ X2 @ X3 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_6])]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i > $o,X3: $i > $o,X29: $i] :
( ( X2 @ X29 )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) )
| ~ ( X3 @ X29 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i > $o,X3: $i > $o] : ( X2 = X3 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8])]),c_0_9]),c_0_5]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV085^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n012.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.33 % DateTime : Sun May 19 18:58:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best3_rw with 300s (1) cores
% 0.19/0.48 # sh2lt with pid 1865 completed with status 0
% 0.19/0.48 # Result found by sh2lt
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.19/0.48 # Search class: HGUNF-FFSF00-SHHFFMBN
% 0.19/0.48 # Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 0.19/0.48 # Starting ehoh_best6_lambda with 721s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine with 121s (1) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 121s (1) cores
% 0.19/0.48 # Starting sh2lt with 121s (1) cores
% 0.19/0.48 # ehoh_best_sine with pid 1872 completed with status 0
% 0.19/0.48 # Result found by ehoh_best_sine
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.19/0.48 # Search class: HGUNF-FFSF00-SHHFFMBN
% 0.19/0.48 # Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 0.19/0.48 # Starting ehoh_best6_lambda with 721s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine with 121s (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 : 1
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 3
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 3
% 0.19/0.48 # Processed clauses : 25
% 0.19/0.48 # ...of these trivial : 1
% 0.19/0.48 # ...subsumed : 3
% 0.19/0.48 # ...remaining for further processing : 20
% 0.19/0.48 # Other redundant clauses eliminated : 21
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 2
% 0.19/0.48 # Backward-rewritten : 7
% 0.19/0.48 # Generated clauses : 121
% 0.19/0.48 # ...of the previous two non-redundant : 88
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 1
% 0.19/0.48 # Paramodulations : 29
% 0.19/0.48 # Factorizations : 15
% 0.19/0.48 # NegExts : 2
% 0.19/0.48 # Equation resolutions : 21
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 24
% 0.19/0.48 # ...of those cached : 5
% 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 : 4
% 0.19/0.48 # Positive orientable unit clauses : 0
% 0.19/0.48 # Positive unorientable unit clauses: 1
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 3
% 0.19/0.48 # Current number of unprocessed clauses: 64
% 0.19/0.48 # ...number of literals in the above : 233
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 16
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 25
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 18
% 0.19/0.48 # Non-unit clause-clause subsumptions : 3
% 0.19/0.48 # Unit Clause-clause subsumption calls : 5
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 57
% 0.19/0.48 # BW rewrite match successes : 19
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 10033
% 0.19/0.48 # Search garbage collected termcells : 152
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1856 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.024 s
% 0.19/0.48 # System time : 0.011 s
% 0.19/0.48 # Total time : 0.035 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------