TSTP Solution File: SEV052^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV052^5 : TPTP v8.2.0. Released v4.0.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 04:07:29 EDT 2024
% Result : Theorem 0.23s 0.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 88 ( 7 equ; 0 cnn)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 179 ( 31 ~; 20 |; 8 &; 118 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 68 ( 68 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 28 ^ 15 !; 2 ?; 45 :)
% 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(cTHM120B_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X1
@ ^ [X2: $i] : $true
@ ^ [X2: $i] : ~ $true )
& ! [X3: $i > $o] : ( X1 @ X3 @ X3 )
& ! [X4: $i > $o,X5: $i > $o,X6: $i > $o] :
( ( ( X1 @ X4 @ X5 )
& ( X1 @ X5 @ X6 ) )
=> ( X1 @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120B_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
& ! [X3: $i > $o] : ( X1 @ X3 @ X3 )
& ! [X4: $i > $o,X5: $i > $o,X6: $i > $o] :
( ( ( X1 @ X4 @ X5 )
& ( X1 @ X5 @ X6 ) )
=> ( X1 @ X4 @ X6 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM120B_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X12: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X12 @ ( epred2_1 @ X12 ) @ ( epred3_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X12 @ ( epred1_1 @ X12 ) @ ( epred1_1 @ X12 ) ) )
& ( ( X12 @ ( epred3_1 @ X12 ) @ ( epred4_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X12 @ ( epred1_1 @ X12 ) @ ( epred1_1 @ X12 ) ) )
& ( ~ ( X12 @ ( epred2_1 @ X12 ) @ ( epred4_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X12 @ ( epred1_1 @ X12 ) @ ( epred1_1 @ X12 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) )
| ( ( ^ [Z0: $i] : ~ $true )
= ( ^ [Z0: $i] : $true ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( ( ^ [Z0: $i] : ~ $true )
= ( ^ [Z0: $i] : $true ) )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) ),
inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_8])]) ).
thf(c_0_12,negated_conjecture,
( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ),
inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_9])]) ).
thf(c_0_13,negated_conjecture,
( ( ^ [Z0: $i] : ~ $true )
= ( ^ [Z0: $i] : $true ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV052^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 19:14:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.48 Running higher-order theorem proving
% 0.23/0.48 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.23/0.49 # Version: 3.1.0-ho
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # Starting sh2lt with 300s (1) cores
% 0.23/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.23/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.23/0.49 # post_as_ho5 with pid 7954 completed with status 0
% 0.23/0.49 # Result found by post_as_ho5
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.23/0.49 # Search class: HGUNF-FFSF00-SHHFFMBN
% 0.23/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.49 # Starting ehoh_best6_lambda with 811s (1) cores
% 0.23/0.49 # Starting post_as_ho5 with 151s (1) cores
% 0.23/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 136s (1) cores
% 0.23/0.49 # Starting sh2lt with 136s (1) cores
% 0.23/0.49 # Starting sh2l with 136s (1) cores
% 0.23/0.49 # ehoh_best_nonlift_nonlambdatoforall with pid 7962 completed with status 0
% 0.23/0.49 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.23/0.49 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting post_as_ho5 with 1500s (5) cores
% 0.23/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.23/0.49 # Search class: HGUNF-FFSF00-SHHFFMBN
% 0.23/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.49 # Starting ehoh_best6_lambda with 811s (1) cores
% 0.23/0.49 # Starting post_as_ho5 with 151s (1) cores
% 0.23/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 136s (1) cores
% 0.23/0.49 # Preprocessing time : 0.001 s
% 0.23/0.49 # Presaturation interreduction done
% 0.23/0.49
% 0.23/0.49 # Proof found!
% 0.23/0.49 # SZS status Theorem
% 0.23/0.49 # SZS output start CNFRefutation
% See solution above
% 0.23/0.49 # Parsed axioms : 1
% 0.23/0.49 # Removed by relevancy pruning/SinE : 0
% 0.23/0.49 # Initial clauses : 3
% 0.23/0.49 # Removed in clause preprocessing : 0
% 0.23/0.49 # Initial clauses in saturation : 3
% 0.23/0.49 # Processed clauses : 25
% 0.23/0.49 # ...of these trivial : 4
% 0.23/0.49 # ...subsumed : 2
% 0.23/0.49 # ...remaining for further processing : 19
% 0.23/0.49 # Other redundant clauses eliminated : 0
% 0.23/0.49 # Clauses deleted for lack of memory : 0
% 0.23/0.49 # Backward-subsumed : 1
% 0.23/0.49 # Backward-rewritten : 4
% 0.23/0.49 # Generated clauses : 57
% 0.23/0.49 # ...of the previous two non-redundant : 39
% 0.23/0.49 # ...aggressively subsumed : 0
% 0.23/0.49 # Contextual simplify-reflections : 0
% 0.23/0.49 # Paramodulations : 2
% 0.23/0.49 # Factorizations : 0
% 0.23/0.49 # NegExts : 2
% 0.23/0.49 # Equation resolutions : 0
% 0.23/0.49 # Disequality decompositions : 0
% 0.23/0.49 # Total rewrite steps : 9
% 0.23/0.49 # ...of those cached : 7
% 0.23/0.49 # Propositional unsat checks : 0
% 0.23/0.49 # Propositional check models : 0
% 0.23/0.49 # Propositional check unsatisfiable : 0
% 0.23/0.49 # Propositional clauses : 0
% 0.23/0.49 # Propositional clauses after purity: 0
% 0.23/0.49 # Propositional unsat core size : 0
% 0.23/0.49 # Propositional preprocessing time : 0.000
% 0.23/0.49 # Propositional encoding time : 0.000
% 0.23/0.49 # Propositional solver time : 0.000
% 0.23/0.49 # Success case prop preproc time : 0.000
% 0.23/0.49 # Success case prop encoding time : 0.000
% 0.23/0.49 # Success case prop solver time : 0.000
% 0.23/0.49 # Current number of processed clauses : 8
% 0.23/0.49 # Positive orientable unit clauses : 2
% 0.23/0.49 # Positive unorientable unit clauses: 0
% 0.23/0.49 # Negative unit clauses : 1
% 0.23/0.49 # Non-unit-clauses : 5
% 0.23/0.49 # Current number of unprocessed clauses: 17
% 0.23/0.49 # ...number of literals in the above : 37
% 0.23/0.49 # Current number of archived formulas : 0
% 0.23/0.49 # Current number of archived clauses : 11
% 0.23/0.49 # Clause-clause subsumption calls (NU) : 4
% 0.23/0.49 # Rec. Clause-clause subsumption calls : 4
% 0.23/0.49 # Non-unit clause-clause subsumptions : 2
% 0.23/0.49 # Unit Clause-clause subsumption calls : 3
% 0.23/0.49 # Rewrite failures with RHS unbound : 0
% 0.23/0.49 # BW rewrite match attempts : 3
% 0.23/0.49 # BW rewrite match successes : 2
% 0.23/0.49 # Condensation attempts : 0
% 0.23/0.49 # Condensation successes : 0
% 0.23/0.49 # Termbank termtop insertions : 3688
% 0.23/0.49 # Search garbage collected termcells : 116
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.005 s
% 0.23/0.49 # System time : 0.002 s
% 0.23/0.49 # Total time : 0.007 s
% 0.23/0.49 # Maximum resident set size: 1820 pages
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.019 s
% 0.23/0.49 # System time : 0.010 s
% 0.23/0.49 # Total time : 0.029 s
% 0.23/0.49 # Maximum resident set size: 1712 pages
% 0.23/0.49 % E---3.1 exiting
% 0.23/0.49 % E exiting
%------------------------------------------------------------------------------