TSTP Solution File: SEV229^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV229^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:08:02 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 110 ( 1 equ; 0 cnn)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 260 ( 57 ~; 67 |; 15 &; 114 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 2 ^ 16 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
cE: a > $o ).
thf(decl_23,type,
cD: a > $o ).
thf(decl_24,type,
epred1_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a ).
thf(decl_27,type,
esk3_0: a ).
thf(cX5209_pme,conjecture,
( ( ^ [X1: a > $o] :
! [X2: a] :
( ( X1 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) ) )
= ( ^ [X3: a > $o] :
( ! [X4: a] :
( ( X3 @ X4 )
=> ( cD @ X4 ) )
& ! [X4: a] :
( ( X3 @ X4 )
=> ( cE @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5209_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X5: a > $o] :
( ! [X2: a] :
( ( X5 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) )
<=> ( ! [X4: a] :
( ( X5 @ X4 )
=> ( cD @ X4 ) )
& ! [X4: a] :
( ( X5 @ X4 )
=> ( cE @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5209_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X10: a,X11: a,X12: a] :
( ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( epred1_0 @ X11 )
| ( cD @ X11 )
| ( cD @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cE @ X12 )
| ( cD @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X11 )
| ( cD @ X11 )
| ( cE @ X10 )
| ~ ( epred1_0 @ X10 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cE @ X12 )
| ( cE @ X10 )
| ~ ( epred1_0 @ X10 ) ) ),
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,
! [X2: a,X4: a] :
( ( cD @ X2 )
| ( cD @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a,X4: a] :
( ( cE @ X2 )
| ( cE @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: a] :
( ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X2: a] :
( ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ~ ( cE @ esk1_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_9]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
~ ( cE @ esk3_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_6]),c_0_13]),c_0_14]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_6]),c_0_13]) ).
thf(c_0_20,negated_conjecture,
~ ( epred1_0 @ esk3_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
thf(c_0_21,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cE @ esk1_0 )
| ~ ( cD @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_6]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
epred1_0 @ esk1_0,
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
~ ( cE @ esk1_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_6]),c_0_22])]),c_0_20]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_9]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV229^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 19:01:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.49 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_4 with 300s (1) cores
% 0.20/0.49 # new_ho_13 with pid 27641 completed with status 0
% 0.20/0.49 # Result found by new_ho_13
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.49 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SHHFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 27644 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.49 # Starting new_ho_13 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SHHFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 15
% 0.20/0.49 # Removed in clause preprocessing : 3
% 0.20/0.49 # Initial clauses in saturation : 12
% 0.20/0.49 # Processed clauses : 32
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 30
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 12
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 15
% 0.20/0.49 # ...of the previous two non-redundant : 12
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 7
% 0.20/0.49 # Paramodulations : 14
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 3
% 0.20/0.49 # ...of those cached : 2
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 6
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 24
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 21
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 21
% 0.20/0.49 # Non-unit clause-clause subsumptions : 18
% 0.20/0.49 # Unit Clause-clause subsumption calls : 5
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 32
% 0.20/0.49 # Condensation successes : 2
% 0.20/0.49 # Termbank termtop insertions : 1101
% 0.20/0.49 # Search garbage collected termcells : 245
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1788 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1720 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------