TSTP Solution File: SEV179^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 9 unt; 3 typ; 0 def)
% Number of atoms : 24 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 74 ( 13 ~; 3 |; 9 &; 49 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 9 ^ 5 !; 9 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cD_FOR_X5309: ( ( $i > $o ) > $i ) > $i > $o ).
thf(decl_23,type,
esk1_0: ( $i > $o ) > $i ).
thf(decl_24,type,
epred1_0: $i > $o ).
thf(cD_FOR_X5309_def,axiom,
( cD_FOR_X5309
= ( ^ [X1: ( $i > $o ) > $i,X2: $i] :
? [X3: $i > $o] :
( ~ ( X3 @ ( X1 @ X3 ) )
& ( X2
= ( X1 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cD_FOR_X5309_def) ).
thf(cTHM144C_pme,conjecture,
! [X1: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X1 @ ( X1 @ ( cD_FOR_X5309 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM144C_pme) ).
thf(c_0_2,plain,
( cD_FOR_X5309
= ( ^ [Z0: ( $i > $o ) > $i,Z1: $i] :
? [X3: $i > $o] :
( ~ ( X3 @ ( Z0 @ X3 ) )
& ( Z1
= ( Z0 @ X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cD_FOR_X5309_def]) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( ( X1
@ ^ [Z0: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X1 @ X5 ) )
& ( Z0
= ( X1 @ X5 ) ) ) )
= ( X1 @ X6 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM144C_pme]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X8: $i > $o] :
( ( X8 @ ( esk1_0 @ X8 ) )
| ( ( esk1_0
@ ^ [Z0: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( esk1_0 @ X5 ) )
& ( Z0
= ( esk1_0 @ X5 ) ) ) )
!= ( esk1_0 @ X8 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_5,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ ( esk1_0 @ X3 ) )
| ( ( esk1_0
@ ^ [Z0: $i] :
? [X12: $i > $o] :
( ~ ( X12 @ ( esk1_0 @ X12 ) )
& ( Z0
= ( esk1_0 @ X12 ) ) ) )
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
? [X13: $i > $o] :
( ~ ( X13 @ ( esk1_0 @ X13 ) )
& ( ( esk1_0
@ ^ [Z0: $i] :
? [X14: $i > $o] :
( ~ ( X14 @ ( esk1_0 @ X14 ) )
& ( Z0
= ( esk1_0 @ X14 ) ) ) )
= ( esk1_0 @ X13 ) ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( esk1_0
@ ^ [Z0: $i] :
? [X15: $i > $o] :
( ~ ( X15 @ ( esk1_0 @ X15 ) )
& ( Z0
= ( esk1_0 @ X15 ) ) ) )
= ( esk1_0 @ epred1_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i > $o] :
( ( X3 @ ( esk1_0 @ X3 ) )
| ( ( esk1_0 @ epred1_0 )
!= ( esk1_0 @ X3 ) ) ),
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
thf(c_0_9,negated_conjecture,
epred1_0 @ ( esk1_0 @ epred1_0 ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.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:47:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48 # full_lambda_6 with pid 12913 completed with status 0
% 0.20/0.48 # Result found by full_lambda_6
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.48 # Search class: HHUSF-FFSF00-DHHFMMBN
% 0.20/0.48 # partial match(4): HGUNF-FFSF00-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ehoh_best6_lambda with 163s (1) cores
% 0.20/0.48 # ehoh_best6_lambda with pid 12916 completed with status 0
% 0.20/0.48 # Result found by ehoh_best6_lambda
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.48 # Search class: HHUSF-FFSF00-DHHFMMBN
% 0.20/0.48 # partial match(4): HGUNF-FFSF00-SHHFFMBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ehoh_best6_lambda with 163s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 3
% 0.20/0.48 # Removed by relevancy pruning/SinE : 1
% 0.20/0.48 # Initial clauses : 1
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 1
% 0.20/0.48 # Processed clauses : 13
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 2
% 0.20/0.48 # ...remaining for further processing : 10
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 2
% 0.20/0.48 # Generated clauses : 19
% 0.20/0.48 # ...of the previous two non-redundant : 16
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 1
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 1
% 0.20/0.48 # Equation resolutions : 2
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 7
% 0.20/0.48 # ...of those cached : 5
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 6
% 0.20/0.48 # Positive orientable unit clauses : 3
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 1
% 0.20/0.48 # Current number of unprocessed clauses: 5
% 0.20/0.48 # ...number of literals in the above : 6
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 4
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 1
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1352
% 0.20/0.48 # Search garbage collected termcells : 78
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1776 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.005 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1724 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------