TSTP Solution File: SEV186^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV186^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:56 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 200 ( 29 ~; 30 |; 10 &; 111 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 55 ( 55 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 50 ( 0 ^ 50 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_22,type,
epred1_0: ( b > $o ) > ( b > $o ) > $o ).
thf(decl_23,type,
epred2_0: ( b > $o ) > $o ).
thf(decl_24,type,
esk1_3: ( b > $o ) > ( b > $o ) > ( b > $o ) > b ).
thf(decl_25,type,
epred3_0: b > $o ).
thf(decl_26,type,
epred4_0: b > $o ).
thf(decl_27,type,
esk2_0: b ).
thf(decl_28,type,
epred5_0: b > $o ).
thf(cTHM565_pme,conjecture,
! [X1: ( b > $o ) > ( b > $o ) > $o,X2: ( b > $o ) > $o] :
( ! [X3: b > $o] :
( ( X2 @ X3 )
=> ! [X4: b > $o,X5: b > $o] :
( ( ! [X6: b] :
( ( X4 @ X6 )
=> ( X3 @ X6 ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X6: b] :
( ( X5 @ X6 )
=> ( X3 @ X6 ) ) ) )
=> ! [X4: b > $o,X5: b > $o] :
( ( ! [X7: b] :
( ( X4 @ X7 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X7 ) ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X9: b] :
( ( X5 @ X9 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X9 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM565_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( b > $o ) > ( b > $o ) > $o,X2: ( b > $o ) > $o] :
( ! [X3: b > $o] :
( ( X2 @ X3 )
=> ! [X4: b > $o,X5: b > $o] :
( ( ! [X6: b] :
( ( X4 @ X6 )
=> ( X3 @ X6 ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X6: b] :
( ( X5 @ X6 )
=> ( X3 @ X6 ) ) ) )
=> ! [X4: b > $o,X5: b > $o] :
( ( ! [X7: b] :
( ( X4 @ X7 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X7 ) ) )
& ( X1 @ X4 @ X5 ) )
=> ! [X9: b] :
( ( X5 @ X9 )
=> ! [X8: b > $o] :
( ( X2 @ X8 )
=> ( X8 @ X9 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM565_pme]) ).
thf(c_0_2,negated_conjecture,
! [X25: b > $o,X26: b > $o,X27: b > $o,X29: b,X32: b,X33: b > $o] :
( ( ( X26 @ ( esk1_3 @ X25 @ X26 @ X27 ) )
| ~ ( epred1_0 @ X26 @ X27 )
| ~ ( X27 @ X29 )
| ( X25 @ X29 )
| ~ ( epred2_0 @ X25 ) )
& ( ~ ( X25 @ ( esk1_3 @ X25 @ X26 @ X27 ) )
| ~ ( epred1_0 @ X26 @ X27 )
| ~ ( X27 @ X29 )
| ( X25 @ X29 )
| ~ ( epred2_0 @ X25 ) )
& ( ~ ( epred3_0 @ X32 )
| ~ ( epred2_0 @ X33 )
| ( X33 @ X32 ) )
& ( epred1_0 @ epred3_0 @ epred4_0 )
& ( epred4_0 @ esk2_0 )
& ( epred2_0 @ epred5_0 )
& ~ ( epred5_0 @ esk2_0 ) ),
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: b > $o,X6: b,X5: b > $o,X4: b > $o] :
( ( X3 @ ( esk1_3 @ X4 @ X3 @ X5 ) )
| ( X4 @ X6 )
| ~ ( epred1_0 @ X3 @ X5 )
| ~ ( X5 @ X6 )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred1_0 @ epred3_0 @ epred4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X6: b,X3: b > $o] :
( ( X3 @ X6 )
| ~ ( epred3_0 @ X6 )
| ~ ( epred2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
epred2_0 @ epred5_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: b > $o,X6: b] :
( ( epred3_0 @ ( esk1_3 @ X3 @ epred3_0 @ epred4_0 ) )
| ( X3 @ X6 )
| ~ ( epred2_0 @ X3 )
| ~ ( epred4_0 @ X6 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X4: b > $o,X6: b,X5: b > $o,X3: b > $o] :
( ( X3 @ X6 )
| ~ ( X3 @ ( esk1_3 @ X3 @ X4 @ X5 ) )
| ~ ( epred1_0 @ X4 @ X5 )
| ~ ( X5 @ X6 )
| ~ ( epred2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X6: b] :
( ( epred5_0 @ X6 )
| ~ ( epred3_0 @ X6 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X6: b] :
( ( epred3_0 @ ( esk1_3 @ epred5_0 @ epred3_0 @ epred4_0 ) )
| ( epred5_0 @ X6 )
| ~ ( epred4_0 @ X6 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_11,negated_conjecture,
epred4_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
~ ( epred5_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X3: b > $o,X4: b > $o,X6: b] :
( ( epred5_0 @ X6 )
| ~ ( epred3_0 @ ( esk1_3 @ epred5_0 @ X3 @ X4 ) )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( X4 @ X6 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_6])]) ).
thf(c_0_14,negated_conjecture,
epred3_0 @ ( esk1_3 @ epred5_0 @ epred3_0 @ epred4_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X6: b] :
( ( epred5_0 @ X6 )
| ~ ( epred4_0 @ X6 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_4])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV186^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 18:54:23 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.50 Running higher-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting sh2lt with 1200s (4) cores
% 0.20/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.51 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.51 # full_lambda_6 with pid 13708 completed with status 0
% 0.20/0.51 # Result found by full_lambda_6
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting sh2lt with 1200s (4) cores
% 0.20/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.51 # Search class: HGUNF-FFSS33-SHHFFSBN
% 0.20/0.51 # partial match(3): HGUNF-FFSF00-SHHFFSBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting ho_unfolding_3 with 135s (1) cores
% 0.20/0.51 # ho_unfolding_3 with pid 13713 completed with status 0
% 0.20/0.51 # Result found by ho_unfolding_3
% 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting sh2lt with 1200s (4) cores
% 0.20/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.51 # Search class: HGUNF-FFSS33-SHHFFSBN
% 0.20/0.51 # partial match(3): HGUNF-FFSF00-SHHFFSBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting ho_unfolding_3 with 135s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 2
% 0.20/0.51 # Removed by relevancy pruning/SinE : 1
% 0.20/0.51 # Initial clauses : 7
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 7
% 0.20/0.51 # Processed clauses : 21
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 21
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 10
% 0.20/0.51 # ...of the previous two non-redundant : 9
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 9
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 5
% 0.20/0.51 # ...of those cached : 1
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 13
% 0.20/0.51 # Positive orientable unit clauses : 4
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 7
% 0.20/0.51 # Current number of unprocessed clauses: 1
% 0.20/0.51 # ...number of literals in the above : 4
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 8
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 15
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 21
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1345
% 0.20/0.51 # Search garbage collected termcells : 356
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.003 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.005 s
% 0.20/0.51 # Maximum resident set size: 1912 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1724 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------