TSTP Solution File: SEV084^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV084^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Mon Jun 24 15:53:28 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 134 ( 10 equ; 0 cnn)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 233 ( 41 ~; 38 |; 18 &; 132 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 10 ^ 25 !; 2 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cP: $o ).
thf(decl_23,type,
epred1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_24,type,
epred2_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_25,type,
epred3_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_26,type,
epred4_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_27,type,
epred5_0: $i > $o ).
thf(decl_28,type,
epred6_0: $i > $o ).
thf(cTHM120J_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X1
@ ^ [X2: $i] :
( cP
| ~ cP )
@ ^ [X2: $i] :
( cP
& ~ cP ) )
& ! [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/sandbox/tmp/tmp.0oXlrJaWH6/E---3.1_14610.p',cTHM120J_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X1
@ ^ [Z0: $i] :
( cP
| ~ cP )
@ ^ [Z0: $i] :
( cP
& ~ cP ) )
& ! [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)],[cTHM120J_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X12: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X12 @ ( epred2_1 @ X12 ) @ ( epred3_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] :
( cP
| ~ cP )
@ ^ [Z0: $i] :
( cP
& ~ cP ) )
| ~ ( X12 @ ( epred1_1 @ X12 ) @ ( epred1_1 @ X12 ) ) )
& ( ( X12 @ ( epred3_1 @ X12 ) @ ( epred4_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] :
( cP
| ~ cP )
@ ^ [Z0: $i] :
( cP
& ~ cP ) )
| ~ ( X12 @ ( epred1_1 @ X12 ) @ ( epred1_1 @ X12 ) ) )
& ( ~ ( X12 @ ( epred2_1 @ X12 ) @ ( epred4_1 @ X12 ) )
| ( X12
@ ^ [Z0: $i] :
( cP
| ~ cP )
@ ^ [Z0: $i] :
( cP
& ~ cP ) )
| ~ ( 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,plain,
! [X18: $i] :
( ( epred6_0 @ X18 )
<=> ( cP
& ~ cP ) ),
introduced(definition) ).
thf(c_0_4,plain,
! [X17: $i] :
( ( epred5_0 @ X17 )
<=> ( cP
| ~ cP ) ),
introduced(definition) ).
thf(c_0_5,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ( ( X1 @ epred5_0 @ epred6_0 )
= $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]),c_0_4]) ).
thf(c_0_6,plain,
! [X23: $i] :
( ( ~ ( epred5_0 @ X23 )
| cP
| ~ cP )
& ( ~ cP
| ( epred5_0 @ X23 ) )
& ( cP
| ( epred5_0 @ X23 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])]) ).
thf(c_0_7,plain,
! [X24: $i] :
( ( cP
| ~ ( epred6_0 @ X24 ) )
& ( ~ cP
| ~ ( epred6_0 @ X24 ) )
& ( ~ cP
| cP
| ( epred6_0 @ X24 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X1 @ epred5_0 @ epred6_0 )
= $true )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]),c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ( X1 @ epred5_0 @ epred6_0 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
! [X2: $i] :
( ( epred5_0 @ X2 )
| ~ cP ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X2: $i] :
( cP
| ( epred5_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
! [X2: $i] :
( cP
| ~ ( epred6_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
! [X2: $i] :
( ~ cP
| ~ ( epred6_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ epred5_0 @ epred6_0 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( ( X1 @ epred5_0 @ epred6_0 )
= $true )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]),c_0_3]),c_0_4]) ).
thf(c_0_16,negated_conjecture,
( ( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) )
| ( epred6_0 = epred5_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_9]) ).
thf(c_0_17,plain,
! [X2: $i] : ( epred5_0 @ X2 ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_18,plain,
! [X2: $i] :
~ ( epred6_0 @ X2 ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_19,negated_conjecture,
( ( epred6_0 = epred5_0 )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_14]) ).
thf(c_0_20,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ( X1 @ epred5_0 @ epred6_0 )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_15]) ).
thf(c_0_21,negated_conjecture,
( ( epred3_1 @ $eq )
= ( epred2_1 @ $eq ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_16]),c_0_17]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_19]),c_0_17]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
epred6_0 = epred5_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_20]),c_0_21]),c_0_22]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_23]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEV084^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n020.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 : Fri Jun 21 19:15:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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/tmp/tmp.0oXlrJaWH6/E---3.1_14610.p
% 0.21/0.51 # Version: 3.2.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.51 # Starting sh2lt with 300s (1) cores
% 0.21/0.51 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.51 # sh2lt with pid 14689 completed with status 0
% 0.21/0.51 # Result found by sh2lt
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.51 # Starting sh2lt with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.51 # Search class: HGHNF-FFSF00-SHHFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.21/0.51 # ehoh_best_nonlift with pid 14699 completed with status 0
% 0.21/0.51 # Result found by ehoh_best_nonlift
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho5 with 1500s (5) cores
% 0.21/0.51 # Starting sh2lt with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.51 # Search class: HGHNF-FFSF00-SHHFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ehoh_best_nonlift with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 2
% 0.21/0.51 # Removed by relevancy pruning/SinE : 1
% 0.21/0.51 # Initial clauses : 9
% 0.21/0.51 # Removed in clause preprocessing : 2
% 0.21/0.51 # Initial clauses in saturation : 7
% 0.21/0.51 # Processed clauses : 25
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 1
% 0.21/0.51 # ...remaining for further processing : 23
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 4
% 0.21/0.51 # Backward-rewritten : 3
% 0.21/0.51 # Generated clauses : 48
% 0.21/0.51 # ...of the previous two non-redundant : 37
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 2
% 0.21/0.51 # Paramodulations : 1
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 2
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 10
% 0.21/0.51 # ...of those cached : 2
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 9
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 4
% 0.21/0.51 # Current number of unprocessed clauses: 21
% 0.21/0.51 # ...number of literals in the above : 50
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 14
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 5
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 5
% 0.21/0.51 # Non-unit clause-clause subsumptions : 2
% 0.21/0.51 # Unit Clause-clause subsumption calls : 8
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 4
% 0.21/0.51 # BW rewrite match successes : 3
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4635
% 0.21/0.51 # Search garbage collected termcells : 172
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1792 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.011 s
% 0.21/0.51 # Maximum resident set size: 1720 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------