TSTP Solution File: SEV137^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV137^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:51 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 33 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 214 ( 23 ~; 31 |; 16 &; 124 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 ^ 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > a > $o ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_1: ( a > $o ) > a ).
thf(decl_27,type,
esk5_1: ( a > $o ) > a ).
thf(decl_28,type,
esk6_1: ( a > $o ) > a ).
thf(decl_29,type,
esk7_1: ( a > $o ) > a ).
thf(decl_30,type,
epred2_0: a > $o ).
thf(cTHM204_pme,conjecture,
! [X1: a > a > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
& ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X3 )
=> ( X5 @ X4 ) ) ) )
=> ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM204_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: a,X3: a,X4: a] :
( ( ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
& ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X3 )
=> ( X5 @ X4 ) ) ) )
=> ! [X5: a > $o] :
( ! [X6: a,X7: a] :
( ( ( X1 @ X6 @ X7 )
& ( X5 @ X6 ) )
=> ( X5 @ X7 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM204_pme]) ).
thf(c_0_2,negated_conjecture,
! [X25: a > $o,X28: a > $o,X32: a,X33: a] :
( ( ( epred1_0 @ ( esk4_1 @ X25 ) @ ( esk5_1 @ X25 ) )
| ~ ( X25 @ esk1_0 )
| ( X25 @ esk2_0 ) )
& ( ( X25 @ ( esk4_1 @ X25 ) )
| ~ ( X25 @ esk1_0 )
| ( X25 @ esk2_0 ) )
& ( ~ ( X25 @ ( esk5_1 @ X25 ) )
| ~ ( X25 @ esk1_0 )
| ( X25 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X28 ) @ ( esk7_1 @ X28 ) )
| ~ ( X28 @ esk2_0 )
| ( X28 @ esk3_0 ) )
& ( ( X28 @ ( esk6_1 @ X28 ) )
| ~ ( X28 @ esk2_0 )
| ( X28 @ esk3_0 ) )
& ( ~ ( X28 @ ( esk7_1 @ X28 ) )
| ~ ( X28 @ esk2_0 )
| ( X28 @ esk3_0 ) )
& ( ~ ( epred1_0 @ X32 @ X33 )
| ~ ( epred2_0 @ X32 )
| ( epred2_0 @ X33 ) )
& ( epred2_0 @ esk1_0 )
& ~ ( epred2_0 @ esk3_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,
! [X5: a > $o] :
( ( epred1_0 @ ( esk4_1 @ X5 ) @ ( esk5_1 @ X5 ) )
| ( X5 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
epred2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X5: a > $o] :
( ( X5 @ ( esk4_1 @ X5 ) )
| ( X5 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X2: a] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X2 @ X3 )
| ~ ( epred2_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( epred2_0 @ ( esk4_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X5: a > $o] :
( ( X5 @ esk2_0 )
| ~ ( X5 @ ( esk5_1 @ X5 ) )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ ( esk5_1 @ epred2_0 ) )
| ( epred2_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X5: a > $o] :
( ( epred1_0 @ ( esk6_1 @ X5 ) @ ( esk7_1 @ X5 ) )
| ( X5 @ esk3_0 )
| ~ ( X5 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
epred2_0 @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_4])]) ).
thf(c_0_13,negated_conjecture,
~ ( epred2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X5: a > $o] :
( ( X5 @ ( esk6_1 @ X5 ) )
| ( X5 @ esk3_0 )
| ~ ( X5 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
epred1_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
epred2_0 @ ( esk6_1 @ epred2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X5: a > $o] :
( ( X5 @ esk3_0 )
| ~ ( X5 @ ( esk7_1 @ X5 ) )
| ~ ( X5 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
epred2_0 @ ( esk7_1 @ epred2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_15]),c_0_16])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV137^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 19:13:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # new_bool_9 with pid 29784 completed with status 0
% 0.21/0.50 # Result found by new_bool_9
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HGUNF-FFSF11-SSSFFMBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 163s (1) cores
% 0.21/0.50 # ehoh_best_nonlift_nonlambdatoforall with pid 29791 completed with status 0
% 0.21/0.50 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HGUNF-FFSF11-SSSFFMBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 2
% 0.21/0.50 # Removed by relevancy pruning/SinE : 1
% 0.21/0.50 # Initial clauses : 9
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 9
% 0.21/0.50 # Processed clauses : 29
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 29
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 3
% 0.21/0.50 # Generated clauses : 34
% 0.21/0.50 # ...of the previous two non-redundant : 19
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 1
% 0.21/0.50 # Paramodulations : 9
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 6
% 0.21/0.50 # ...of those cached : 3
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 17
% 0.21/0.50 # Positive orientable unit clauses : 5
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 11
% 0.21/0.50 # Current number of unprocessed clauses: 8
% 0.21/0.50 # ...number of literals in the above : 16
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 12
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 16
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 16
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1735
% 0.21/0.50 # Search garbage collected termcells : 334
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1764 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1720 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------