TSTP Solution File: SEV088^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV088^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:34 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 11 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 45 ( 0 equ; 0 cnn)
% Maximal formula atoms : 40 ( 9 avg)
% Number of connectives : 279 ( 15 ~; 21 |; 11 &; 230 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 124 ( 124 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 26 ( 0 ^ 22 !; 4 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_23,type,
epred2_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_24,type,
epred3_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_25,type,
esk1_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i ).
thf(decl_26,type,
epred4_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_27,type,
esk2_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i ).
thf(cTHM120G_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ! [X6: $i] :
( ( X2 @ X3 @ X4 @ X6 )
| ( X1 @ X3 @ X4 @ X6 ) )
& ! [X6: $i] :
( ( X2 @ X4 @ X5 @ X6 )
| ( X1 @ X4 @ X5 @ X6 ) ) )
=> ! [X6: $i] :
( ( X2 @ X3 @ X5 @ X6 )
| ( X1 @ X3 @ X5 @ X6 ) ) )
& ! [X3: $i > $o,X6: $i] :
( ( X2 @ X3 @ X3 @ X6 )
| ( X1 @ X3 @ X3 @ X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120G_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ! [X6: $i] :
( ( X2 @ X3 @ X4 @ X6 )
| ( X1 @ X3 @ X4 @ X6 ) )
& ! [X6: $i] :
( ( X2 @ X4 @ X5 @ X6 )
| ( X1 @ X4 @ X5 @ X6 ) ) )
=> ! [X6: $i] :
( ( X2 @ X3 @ X5 @ X6 )
| ( X1 @ X3 @ X5 @ X6 ) ) )
& ! [X3: $i > $o,X6: $i] :
( ( X2 @ X3 @ X3 @ X6 )
| ( X1 @ X3 @ X3 @ X6 ) ) ),
inference(assume_negation,[status(cth)],[cTHM120G_pme]) ).
thf(c_0_2,negated_conjecture,
! [X17: ( $i > $o ) > ( $i > $o ) > $i > $o,X18: ( $i > $o ) > ( $i > $o ) > $i > $o,X22: $i,X23: $i] :
( ( ~ ( X18 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ( X18 @ ( epred1_2 @ X17 @ X18 ) @ ( epred2_2 @ X17 @ X18 ) @ X22 )
| ( X17 @ ( epred1_2 @ X17 @ X18 ) @ ( epred2_2 @ X17 @ X18 ) @ X22 ) )
& ( ~ ( X17 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ( X18 @ ( epred1_2 @ X17 @ X18 ) @ ( epred2_2 @ X17 @ X18 ) @ X22 )
| ( X17 @ ( epred1_2 @ X17 @ X18 ) @ ( epred2_2 @ X17 @ X18 ) @ X22 ) )
& ( ~ ( X18 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ( X18 @ ( epred2_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ X23 )
| ( X17 @ ( epred2_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ X23 ) )
& ( ~ ( X17 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ( X18 @ ( epred2_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ X23 )
| ( X17 @ ( epred2_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ X23 ) )
& ( ~ ( X18 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ~ ( X18 @ ( epred1_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ ( esk1_2 @ X17 @ X18 ) ) )
& ( ~ ( X17 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ~ ( X18 @ ( epred1_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ ( esk1_2 @ X17 @ X18 ) ) )
& ( ~ ( X18 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ~ ( X17 @ ( epred1_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ ( esk1_2 @ X17 @ X18 ) ) )
& ( ~ ( X17 @ ( epred4_2 @ X17 @ X18 ) @ ( epred4_2 @ X17 @ X18 ) @ ( esk2_2 @ X17 @ X18 ) )
| ~ ( X17 @ ( epred1_2 @ X17 @ X18 ) @ ( epred3_2 @ X17 @ X18 ) @ ( esk1_2 @ X17 @ 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,
! [X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ~ ( X1 @ ( epred4_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ ( esk2_2 @ X2 @ X1 ) )
| ~ ( X1 @ ( epred1_2 @ X2 @ X1 ) @ ( epred3_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV088^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 19:18:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting sh2lt with 1200s (4) cores
% 0.20/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.48 # new_ho_10_unif with pid 17975 completed with status 0
% 0.20/0.48 # Result found by new_ho_10_unif
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting sh2lt with 1200s (4) cores
% 0.20/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGHNF-FFSF22-SHHFFMBN
% 0.20/0.48 # partial match(1): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting pre_casc_2 with 109s (1) cores
% 0.20/0.48 # pre_casc_2 with pid 17979 completed with status 0
% 0.20/0.48 # Result found by pre_casc_2
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting sh2lt with 1200s (4) cores
% 0.20/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGHNF-FFSF22-SHHFFMBN
% 0.20/0.48 # partial match(1): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting pre_casc_2 with 109s (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 : 1
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 8
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 8
% 0.20/0.48 # Processed clauses : 1
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 0
% 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 : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 0
% 0.20/0.48 # ...of the previous two non-redundant : 0
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 0
% 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 : 0
% 0.20/0.48 # ...of those cached : 0
% 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 : 0
% 0.20/0.48 # Positive orientable unit clauses : 0
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 7
% 0.20/0.48 # ...number of literals in the above : 18
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 0
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 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 : 1
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 630
% 0.20/0.48 # Search garbage collected termcells : 213
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1788 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.005 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1700 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------