TSTP Solution File: SEV396^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:19 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 89 ( 1 equ; 0 cnn)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 191 ( 40 ~; 50 |; 10 &; 86 @)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 1 ^ 10 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cR: $i > $o ).
thf(decl_23,type,
cS: $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(cTHM31_pme,conjecture,
( ! [X1: $i] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ( ( ^ [X1: $i] :
( ( cR @ X1 )
& ( cS @ X1 ) ) )
= cR ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM31_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ! [X3: $i] :
( ( ( cR @ X3 )
& ( cS @ X3 ) )
<=> ( cR @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM31_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X6: $i,X7: $i] :
( ( ~ ( cR @ esk2_0 )
| ~ ( cS @ esk2_0 )
| ~ ( cR @ esk2_0 )
| ( cR @ esk1_0 ) )
& ( ( cR @ esk2_0 )
| ( cR @ esk2_0 )
| ( cR @ esk1_0 ) )
& ( ( cS @ esk2_0 )
| ( cR @ esk2_0 )
| ( cR @ esk1_0 ) )
& ( ~ ( cR @ esk2_0 )
| ~ ( cS @ esk2_0 )
| ~ ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) )
& ( ( cR @ esk2_0 )
| ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) )
& ( ( cS @ esk2_0 )
| ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) )
& ( ~ ( cR @ X7 )
| ~ ( cS @ X7 )
| ( cR @ X7 )
| ~ ( cR @ X6 )
| ( cS @ X6 ) )
& ( ( cR @ X7 )
| ~ ( cR @ X7 )
| ~ ( cR @ X6 )
| ( cS @ X6 ) )
& ( ( cS @ X7 )
| ~ ( cR @ X7 )
| ~ ( cR @ X6 )
| ( cS @ X6 ) ) ),
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,
( ( cR @ esk2_0 )
| ( cR @ esk2_0 )
| ( cR @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cR @ esk2_0 )
| ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cS @ X1 )
| ( cS @ X2 )
| ~ ( cR @ X1 )
| ~ ( cR @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( cR @ esk1_0 )
| ( cR @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ( cR @ esk2_0 )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( cR @ esk1_0 )
| ~ ( cR @ esk2_0 )
| ~ ( cS @ esk2_0 )
| ~ ( cR @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
cR @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ~ ( cR @ esk2_0 )
| ~ ( cS @ esk2_0 )
| ~ ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
( ( cR @ esk1_0 )
| ~ ( cR @ esk2_0 )
| ~ ( cS @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( cS @ esk2_0 )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
thf(c_0_14,negated_conjecture,
( ~ ( cR @ esk2_0 )
| ~ ( cS @ esk1_0 )
| ~ ( cS @ esk2_0 ) ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( cR @ esk1_0 )
| ~ ( cS @ esk2_0 ) ),
inference(csr,[status(thm)],[c_0_12,c_0_6]) ).
thf(c_0_16,negated_conjecture,
cS @ esk2_0,
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
thf(c_0_17,negated_conjecture,
( ~ ( cS @ esk1_0 )
| ~ ( cS @ esk2_0 ) ),
inference(csr,[status(thm)],[c_0_14,c_0_7]) ).
thf(c_0_18,negated_conjecture,
cR @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,negated_conjecture,
~ ( cS @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] :
( ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_18]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:36:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # post_as_ho10 with pid 30177 completed with status 0
% 0.19/0.48 # Result found by post_as_ho10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting sh3 with 163s (1) cores
% 0.19/0.48 # sh3 with pid 30183 completed with status 0
% 0.19/0.48 # Result found by sh3
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting sh3 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 3
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 11
% 0.19/0.48 # Removed in clause preprocessing : 4
% 0.19/0.48 # Initial clauses in saturation : 7
% 0.19/0.48 # Processed clauses : 19
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 2
% 0.19/0.48 # ...remaining for further processing : 17
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 1
% 0.19/0.48 # Backward-rewritten : 6
% 0.19/0.48 # Generated clauses : 8
% 0.19/0.48 # ...of the previous two non-redundant : 8
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 4
% 0.19/0.48 # Paramodulations : 8
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 7
% 0.19/0.48 # ...of those cached : 4
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 5
% 0.19/0.48 # Positive orientable unit clauses : 3
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 12
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 9
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 8
% 0.19/0.48 # Non-unit clause-clause subsumptions : 7
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 2
% 0.19/0.48 # BW rewrite match successes : 2
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 843
% 0.19/0.48 # Search garbage collected termcells : 189
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.004 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1752 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1700 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------