TSTP Solution File: SEV318^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV318^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:08:11 EDT 2024
% Result : Theorem 43.64s 6.01s
% Output : CNFRefutation 43.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 48 ( 0 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 310 ( 19 ~; 21 |; 15 &; 239 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 76 ( 14 ^ 60 !; 2 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
esk1_0: ( a > $o ) > a ).
thf(decl_24,type,
esk2_2: ( a > $o ) > a > a ).
thf(decl_25,type,
esk3_0: a > a ).
thf(cTHM145_B_pme,conjecture,
! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X3 @ X5 ) )
& ! [X6: a > $o] :
( ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( X6 @ X8 )
=> ( X1 @ X8 @ X7 ) )
=> ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) )
=> ! [X9: a > a] :
( ( ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) ) )
=> ? [X10: a] :
( ( X1 @ X10 @ ( X9 @ X10 ) )
& ( X1 @ ( X9 @ X10 ) @ X10 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM145_B_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X3 @ X5 ) )
& ! [X6: a > $o] :
( ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( X6 @ X8 )
=> ( X1 @ X8 @ X7 ) )
=> ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) )
=> ! [X9: a > a] :
( ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
=> ? [X10: a] :
( ( X1 @ X10 @ ( X9 @ X10 ) )
& ( X1 @ ( X9 @ X10 ) @ X10 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_B_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X29: a,X30: a,X31: a,X32: a > $o,X33: a,X34: a,X37: a,X38: a,X39: a] :
( ( ~ ( epred1_0 @ X29 @ X30 )
| ~ ( epred1_0 @ X30 @ X31 )
| ( epred1_0 @ X29 @ X31 ) )
& ( ~ ( X32 @ X33 )
| ( epred1_0 @ X33 @ ( esk1_0 @ X32 ) ) )
& ( ( X32 @ ( esk2_2 @ X32 @ X34 ) )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X32 @ X34 ) @ X34 )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ X37 @ X38 )
| ( epred1_0 @ ( esk3_0 @ X37 ) @ ( esk3_0 @ X38 ) ) )
& ( ~ ( epred1_0 @ X39 @ ( esk3_0 @ X39 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X39 ) @ X39 ) ) ),
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: a,X4: a,X5: a] :
( ( epred1_0 @ X3 @ X5 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X4: a] :
( ( epred1_0 @ ( esk3_0 @ X3 ) @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( epred1_0 @ X3 @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ ( esk3_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X4 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( X6 @ ( esk2_2 @ X6 @ X3 ) )
| ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ X3 @ ( esk1_0 @ X6 ) )
| ~ ( X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X3: a,X21: a > a,X9: a > a,X4: a] :
( ( epred1_0
@ ( X9
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X21 @ Z0 ) ) )
@ X3 ) )
@ ( esk3_0 @ X4 ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X21 @ Z0 ) ) ) )
@ X3 )
| ~ ( epred1_0
@ ( X21
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X21 @ Z0 ) ) )
@ X3 ) )
@ X4 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > a > $o,X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 )
@ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 )
| ~ ( epred1_0 @ ( esk2_2 @ X6 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) )
@ X3 )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X9: a > a,X3: a] :
( ( epred1_0 @ ( esk3_0 @ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ ( X9 @ Z0 ) ) ) ) )
| ~ ( epred1_0 @ X3 @ ( X9 @ ( esk3_0 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
thf(c_0_13,negated_conjecture,
( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: a] :
( ~ ( epred1_0 @ X3 @ ( esk3_0 @ X3 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( epred1_0
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV318^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n013.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sun May 19 18:27:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.49 Running higher-order theorem proving
% 0.19/0.49 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
% 43.64/6.01 # Version: 3.1.0-ho
% 43.64/6.01 # Preprocessing class: HSMSSMSSSSSNHHA.
% 43.64/6.01 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 43.64/6.01 # Starting full_lambda_6 with 900s (3) cores
% 43.64/6.01 # Starting post_as_ho1 with 300s (1) cores
% 43.64/6.01 # Starting lpo6_lambda_fix with 300s (1) cores
% 43.64/6.01 # Starting ho_unfolding_1 with 300s (1) cores
% 43.64/6.01 # Starting new_ho_10_unif with 300s (1) cores
% 43.64/6.01 # Starting ho_unfolding_2 with 300s (1) cores
% 43.64/6.01 # new_ho_10_unif with pid 8210 completed with status 0
% 43.64/6.01 # Result found by new_ho_10_unif
% 43.64/6.01 # Preprocessing class: HSMSSMSSSSSNHHA.
% 43.64/6.01 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 43.64/6.01 # Starting full_lambda_6 with 900s (3) cores
% 43.64/6.01 # Starting post_as_ho1 with 300s (1) cores
% 43.64/6.01 # Starting lpo6_lambda_fix with 300s (1) cores
% 43.64/6.01 # Starting ho_unfolding_1 with 300s (1) cores
% 43.64/6.01 # Starting new_ho_10_unif with 300s (1) cores
% 43.64/6.01 # No SInE strategy applied
% 43.64/6.01 # Search class: HGHNF-FFSF22-SHHFFSBN
% 43.64/6.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 43.64/6.01 # Starting new_ho_10_unif with 100s (1) cores
% 43.64/6.01 # new_ho_10_unif with pid 8218 completed with status 0
% 43.64/6.01 # Result found by new_ho_10_unif
% 43.64/6.01 # Preprocessing class: HSMSSMSSSSSNHHA.
% 43.64/6.01 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 43.64/6.01 # Starting full_lambda_6 with 900s (3) cores
% 43.64/6.01 # Starting post_as_ho1 with 300s (1) cores
% 43.64/6.01 # Starting lpo6_lambda_fix with 300s (1) cores
% 43.64/6.01 # Starting ho_unfolding_1 with 300s (1) cores
% 43.64/6.01 # Starting new_ho_10_unif with 300s (1) cores
% 43.64/6.01 # No SInE strategy applied
% 43.64/6.01 # Search class: HGHNF-FFSF22-SHHFFSBN
% 43.64/6.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 43.64/6.01 # Starting new_ho_10_unif with 100s (1) cores
% 43.64/6.01 # Preprocessing time : 0.001 s
% 43.64/6.01 # Presaturation interreduction done
% 43.64/6.01
% 43.64/6.01 # Proof found!
% 43.64/6.01 # SZS status Theorem
% 43.64/6.01 # SZS output start CNFRefutation
% See solution above
% 43.64/6.01 # Parsed axioms : 2
% 43.64/6.01 # Removed by relevancy pruning/SinE : 0
% 43.64/6.01 # Initial clauses : 7
% 43.64/6.01 # Removed in clause preprocessing : 1
% 43.64/6.01 # Initial clauses in saturation : 6
% 43.64/6.01 # Processed clauses : 865
% 43.64/6.01 # ...of these trivial : 128
% 43.64/6.01 # ...subsumed : 272
% 43.64/6.01 # ...remaining for further processing : 465
% 43.64/6.01 # Other redundant clauses eliminated : 0
% 43.64/6.01 # Clauses deleted for lack of memory : 0
% 43.64/6.01 # Backward-subsumed : 29
% 43.64/6.01 # Backward-rewritten : 47
% 43.64/6.01 # Generated clauses : 48580
% 43.64/6.01 # ...of the previous two non-redundant : 41700
% 43.64/6.01 # ...aggressively subsumed : 0
% 43.64/6.01 # Contextual simplify-reflections : 0
% 43.64/6.01 # Paramodulations : 48396
% 43.64/6.01 # Factorizations : 183
% 43.64/6.01 # NegExts : 0
% 43.64/6.01 # Equation resolutions : 1
% 43.64/6.01 # Disequality decompositions : 0
% 43.64/6.01 # Total rewrite steps : 7285
% 43.64/6.01 # ...of those cached : 6320
% 43.64/6.01 # Propositional unsat checks : 0
% 43.64/6.01 # Propositional check models : 0
% 43.64/6.01 # Propositional check unsatisfiable : 0
% 43.64/6.01 # Propositional clauses : 0
% 43.64/6.01 # Propositional clauses after purity: 0
% 43.64/6.01 # Propositional unsat core size : 0
% 43.64/6.01 # Propositional preprocessing time : 0.000
% 43.64/6.01 # Propositional encoding time : 0.000
% 43.64/6.01 # Propositional solver time : 0.000
% 43.64/6.01 # Success case prop preproc time : 0.000
% 43.64/6.01 # Success case prop encoding time : 0.000
% 43.64/6.01 # Success case prop solver time : 0.000
% 43.64/6.01 # Current number of processed clauses : 383
% 43.64/6.01 # Positive orientable unit clauses : 92
% 43.64/6.01 # Positive unorientable unit clauses: 0
% 43.64/6.01 # Negative unit clauses : 15
% 43.64/6.01 # Non-unit-clauses : 276
% 43.64/6.01 # Current number of unprocessed clauses: 40342
% 43.64/6.01 # ...number of literals in the above : 125900
% 43.64/6.01 # Current number of archived formulas : 0
% 43.64/6.01 # Current number of archived clauses : 82
% 43.64/6.01 # Clause-clause subsumption calls (NU) : 11966
% 43.64/6.01 # Rec. Clause-clause subsumption calls : 10032
% 43.64/6.01 # Non-unit clause-clause subsumptions : 293
% 43.64/6.01 # Unit Clause-clause subsumption calls : 2671
% 43.64/6.01 # Rewrite failures with RHS unbound : 0
% 43.64/6.01 # BW rewrite match attempts : 2202
% 43.64/6.01 # BW rewrite match successes : 57
% 43.64/6.01 # Condensation attempts : 865
% 43.64/6.01 # Condensation successes : 9
% 43.64/6.01 # Termbank termtop insertions : 12460668
% 43.64/6.01 # Search garbage collected termcells : 397
% 43.64/6.01
% 43.64/6.01 # -------------------------------------------------
% 43.64/6.01 # User time : 5.196 s
% 43.64/6.01 # System time : 0.179 s
% 43.64/6.01 # Total time : 5.375 s
% 43.64/6.01 # Maximum resident set size: 1716 pages
% 43.64/6.01
% 43.64/6.01 # -------------------------------------------------
% 43.64/6.01 # User time : 5.197 s
% 43.64/6.01 # System time : 0.181 s
% 43.64/6.01 # Total time : 5.378 s
% 43.64/6.01 # Maximum resident set size: 1732 pages
% 43.64/6.01 % E---3.1 exiting
% 43.64/6.01 % E exiting
%------------------------------------------------------------------------------