TSTP Solution File: SYO317^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO317^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 08:45:36 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 43 ( 0 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 146 ( 17 ~; 12 |; 15 &; 94 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 ^ 34 !; 4 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cP: $i > $o ).
thf(decl_23,type,
f: $i > $i ).
thf(decl_24,type,
cEQ: $i > $i > $o ).
thf(decl_25,type,
a: $i ).
thf(decl_26,type,
esk1_1: ( $i > $o ) > $i ).
thf(cTHM304,conjecture,
( ( ! [X1: $i] : ( cEQ @ X1 @ X1 )
& ! [X1: $i,X2: $i] :
( ( ( cEQ @ X1 @ X2 )
& ( cP @ X1 ) )
=> ( cP @ X2 ) )
& ( cP @ a )
& ! [X2: $i,X3: $i] :
( ( cEQ @ ( f @ X2 ) @ ( f @ X3 ) )
=> ( cEQ @ X2 @ X3 ) ) )
=> ? [X4: $i > $o] :
( ! [X1: $i] :
( ( X4 @ ( f @ X1 ) )
=> ( cP @ X1 ) )
& ? [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM304) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i] : ( cEQ @ X1 @ X1 )
& ! [X1: $i,X2: $i] :
( ( ( cEQ @ X1 @ X2 )
& ( cP @ X1 ) )
=> ( cP @ X2 ) )
& ( cP @ a )
& ! [X2: $i,X3: $i] :
( ( cEQ @ ( f @ X2 ) @ ( f @ X3 ) )
=> ( cEQ @ X2 @ X3 ) ) )
=> ? [X4: $i > $o] :
( ! [X1: $i] :
( ( X4 @ ( f @ X1 ) )
=> ( cP @ X1 ) )
& ? [X3: $i] : ( X4 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM304]) ).
thf(c_0_2,negated_conjecture,
! [X13: $i,X14: $i,X15: $i,X16: $i,X17: $i,X18: $i > $o,X20: $i] :
( ( cEQ @ X13 @ X13 )
& ( ~ ( cEQ @ X14 @ X15 )
| ~ ( cP @ X14 )
| ( cP @ X15 ) )
& ( cP @ a )
& ( ~ ( cEQ @ ( f @ X16 ) @ ( f @ X17 ) )
| ( cEQ @ X16 @ X17 ) )
& ( ( X18 @ ( f @ ( esk1_1 @ X18 ) ) )
| ~ ( X18 @ X20 ) )
& ( ~ ( cP @ ( esk1_1 @ X18 ) )
| ~ ( X18 @ X20 ) ) ),
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,
! [X4: $i > $o,X1: $i] :
( ( X4 @ ( f @ ( esk1_1 @ X4 ) ) )
| ~ ( X4 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i] : ( cEQ @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cEQ @ X1 @ X2 )
| ~ ( cEQ @ ( f @ X1 ) @ ( f @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] : ( cEQ @ X1 @ ( f @ ( esk1_1 @ ( cEQ @ X1 ) ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X1: $i] :
( ( cP @ X2 )
| ~ ( cEQ @ X1 @ X2 )
| ~ ( cP @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] : ( cEQ @ X1 @ ( esk1_1 @ ( cEQ @ ( f @ X1 ) ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i > $o,X1: $i] :
( ~ ( cP @ ( esk1_1 @ X4 ) )
| ~ ( X4 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( cP @ ( esk1_1 @ ( cEQ @ ( f @ X1 ) ) ) )
| ~ ( cP @ X1 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( cEQ @ ( f @ X1 ) @ X2 )
| ~ ( cP @ X1 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
cP @ a,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
~ ( cP @ X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO317^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.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 : Mon May 20 09:35:53 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: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.49 # full_lambda_10 with pid 11618 completed with status 0
% 0.20/0.49 # Result found by full_lambda_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.20/0.49 # Search class: HHHNF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 135s (1) cores
% 0.20/0.49 # new_ho_10 with pid 11622 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.20/0.49 # Search class: HHHNF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 135s (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 : 5
% 0.20/0.49 # Removed by relevancy pruning/SinE : 4
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 6
% 0.20/0.49 # Processed clauses : 19
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 19
% 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 : 5
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 18
% 0.20/0.49 # ...of the previous two non-redundant : 9
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 16
% 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 : 6
% 0.20/0.49 # ...of those cached : 3
% 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 : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 13
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 7
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 19
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 835
% 0.20/0.49 # Search garbage collected termcells : 225
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1724 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------