TSTP Solution File: SEV177^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV177^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:07:56 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 19 ( 6 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 60 ( 10 ~; 7 |; 5 &; 35 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 13 ( 1 ^ 10 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
esk1_0: ( $i > $o ) > $i ).
thf(decl_23,type,
epred1_0: $i > $o ).
thf(decl_24,type,
epred2_1: $i > $i > $o ).
thf(cTHM144_pme,conjecture,
! [X1: ( $i > $o ) > $i,X2: $i > $o] :
( ( X2
= ( ^ [X3: $i] :
? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( X3
= ( X1 @ X4 ) ) ) ) )
=> ( X2 @ ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM144_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i,X2: $i > $o] :
( ! [X7: $i] :
( ( X2 @ X7 )
<=> ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( X7
= ( X1 @ X4 ) ) ) )
=> ( X2 @ ( X1 @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM144_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X10: $i,X12: $i > $o] :
( ( ~ ( epred2_1 @ X10 @ ( esk1_0 @ ( epred2_1 @ X10 ) ) )
| ~ ( epred1_0 @ X10 ) )
& ( ( X10
= ( esk1_0 @ ( epred2_1 @ X10 ) ) )
| ~ ( epred1_0 @ X10 ) )
& ( ( X12 @ ( esk1_0 @ X12 ) )
| ( X10
!= ( esk1_0 @ X12 ) )
| ( epred1_0 @ X10 ) )
& ~ ( epred1_0 @ ( esk1_0 @ epred1_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: $i,X2: $i > $o] :
( ( X2 @ ( esk1_0 @ X2 ) )
| ( epred1_0 @ X3 )
| ( X3
!= ( esk1_0 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $o] :
( ( epred1_0 @ ( esk1_0 @ X2 ) )
| ( X2 @ ( esk1_0 @ X2 ) ) ),
inference(er,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_4]),c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV177^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n013.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 19:10:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best3_rw with 300s (1) cores
% 0.19/0.48 # post_as_ho1 with pid 29005 completed with status 0
% 0.19/0.48 # Result found by post_as_ho1
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHSF-FFSF00-SHHFFSBN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 29007 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.48 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting sh2lt with 1200s (4) cores
% 0.19/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHSF-FFSF00-SHHFFSBN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 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 : 1
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 4
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 4
% 0.19/0.48 # Processed clauses : 9
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 9
% 0.19/0.48 # Other redundant clauses eliminated : 1
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 6
% 0.19/0.48 # ...of the previous two non-redundant : 2
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 3
% 0.19/0.48 # Factorizations : 2
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 1
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # ...of those cached : 0
% 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 : 4
% 0.19/0.48 # Positive orientable unit clauses : 0
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 3
% 0.19/0.48 # Current number of unprocessed clauses: 1
% 0.19/0.48 # ...number of literals in the above : 2
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 4
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 3
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 9
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 488
% 0.19/0.48 # Search garbage collected termcells : 167
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.002 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.003 s
% 0.19/0.48 # Maximum resident set size: 1760 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.003 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.006 s
% 0.19/0.48 # Maximum resident set size: 1700 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------