TSTP Solution File: ITP010^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP010^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Mon May 20 22:15:23 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 12 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 9 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 5 ~; 0 |; 0 &; 26 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
del: $tType ).
thf(decl_22,type,
bool: del ).
thf(decl_24,type,
arr: del > del > del ).
thf(decl_25,type,
mem: $i > del > $o ).
thf(decl_26,type,
ap: $i > $i > $i ).
thf(decl_28,type,
p: $i > $o ).
thf(decl_31,type,
c_2Ecardinal_2Ecardleq: del > del > $i ).
thf(conj_thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
! [X13: del,X14: del,X23: $i] :
( ( mem @ X23 @ ( arr @ X13 @ bool ) )
=> ! [X24: $i] :
( ( mem @ X24 @ ( arr @ X14 @ bool ) )
=> ( ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X14 ) @ X23 ) @ X24 ) )
<=> ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X14 ) @ X23 ) @ X24 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
thf(c_0_1,negated_conjecture,
~ ! [X13: del,X14: del,X23: $i] :
( ( mem @ X23 @ ( arr @ X13 @ bool ) )
=> ! [X24: $i] : $true ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ecardinal_2ECARD__NOT__LE])]) ).
thf(c_0_2,negated_conjecture,
~ $true,
inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
~ $true,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP010^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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 : Sat May 18 17:11:38 EDT 2024
% 0.13/0.34 % 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.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.20/0.50 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 900s (3) cores
% 0.20/0.50 # Starting sh2lt with 300s (1) cores
% 0.20/0.50 # Starting new_ho_5 with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.50 # Starting sh9 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.50 # sh9 with pid 5919 completed with status 0
% 0.20/0.50 # Result found by sh9
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.20/0.50 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 900s (3) cores
% 0.20/0.50 # Starting sh2lt with 300s (1) cores
% 0.20/0.50 # Starting new_ho_5 with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.50 # Starting sh9 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHSM-FFMM32-MSFFFFBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 135s (1) cores
% 0.20/0.50 # new_ho_10 with pid 5924 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.20/0.50 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 900s (3) cores
% 0.20/0.50 # Starting sh2lt with 300s (1) cores
% 0.20/0.50 # Starting new_ho_5 with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.50 # Starting sh9 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGHSM-FFMM32-MSFFFFBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 135s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 58
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 179
% 0.20/0.50 # Removed in clause preprocessing : 113
% 0.20/0.50 # Initial clauses in saturation : 66
% 0.20/0.50 # Processed clauses : 1
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 0
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 0
% 0.20/0.50 # Positive orientable unit clauses : 0
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 65
% 0.20/0.50 # ...number of literals in the above : 231
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 0
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 1
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 10265
% 0.20/0.50 # Search garbage collected termcells : 2517
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 2244 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1800 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------