TSTP Solution File: ITP101^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP101^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:16:18 EDT 2024
% Result : Theorem 0.45s 0.62s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 7 unt; 12 typ; 0 def)
% Number of atoms : 44 ( 18 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 219 ( 16 ~; 11 |; 9 &; 171 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
list_a: $tType ).
thf(decl_22,type,
minus_minus_nat: nat > nat > nat ).
thf(decl_43,type,
nth_a: list_a > nat > a ).
thf(decl_45,type,
size_size_list_a: list_a > nat ).
thf(decl_46,type,
ord_less_nat: nat > nat > $o ).
thf(decl_52,type,
f: nat > a ).
thf(decl_53,type,
g: nat > a ).
thf(decl_54,type,
x: nat ).
thf(decl_55,type,
xs: list_a ).
thf(decl_56,type,
ys: list_a ).
thf(conj_1,hypothesis,
! [X156: nat] :
( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( nth_a @ xs @ X156 )
= ( nth_a @ ys @ X156 ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( f @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ xs ) ) )
= ( nth_a @ ys @ X156 ) ) ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( nth_a @ xs @ X156 )
= ( g @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ ys ) ) ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( f @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ xs ) ) )
= ( g @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ ys ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
thf(conj_3,conjecture,
( ( nth_a @ xs @ x )
= ( nth_a @ ys @ x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_3) ).
thf(conj_2,hypothesis,
ord_less_nat @ x @ ( size_size_list_a @ ys ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).
thf(c_0_3,hypothesis,
! [X156: nat] :
( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( nth_a @ xs @ X156 )
= ( nth_a @ ys @ X156 ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( f @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ xs ) ) )
= ( nth_a @ ys @ X156 ) ) ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( nth_a @ xs @ X156 )
= ( g @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ ys ) ) ) ) )
& ( ~ ( ord_less_nat @ X156 @ ( size_size_list_a @ ys ) )
=> ( ( f @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ xs ) ) )
= ( g @ ( minus_minus_nat @ X156 @ ( size_size_list_a @ ys ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_1]) ).
thf(c_0_4,hypothesis,
! [X1998: nat] :
( ( ~ ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) )
| ( ( nth_a @ xs @ X1998 )
= ( nth_a @ ys @ X1998 ) )
| ~ ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) ) )
& ( ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) )
| ( ( f @ ( minus_minus_nat @ X1998 @ ( size_size_list_a @ xs ) ) )
= ( nth_a @ ys @ X1998 ) )
| ~ ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) ) )
& ( ~ ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) )
| ( ( nth_a @ xs @ X1998 )
= ( g @ ( minus_minus_nat @ X1998 @ ( size_size_list_a @ ys ) ) ) )
| ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) ) )
& ( ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) )
| ( ( f @ ( minus_minus_nat @ X1998 @ ( size_size_list_a @ xs ) ) )
= ( g @ ( minus_minus_nat @ X1998 @ ( size_size_list_a @ ys ) ) ) )
| ( ord_less_nat @ X1998 @ ( size_size_list_a @ ys ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_5,negated_conjecture,
( ( nth_a @ xs @ x )
!= ( nth_a @ ys @ x ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])]) ).
thf(c_0_6,hypothesis,
! [X3: nat] :
( ( ( nth_a @ xs @ X3 )
= ( nth_a @ ys @ X3 ) )
| ~ ( ord_less_nat @ X3 @ ( size_size_list_a @ ys ) )
| ~ ( ord_less_nat @ X3 @ ( size_size_list_a @ ys ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( nth_a @ xs @ x )
!= ( nth_a @ ys @ x ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,hypothesis,
! [X3: nat] :
( ( ( nth_a @ ys @ X3 )
= ( nth_a @ xs @ X3 ) )
| ~ ( ord_less_nat @ X3 @ ( size_size_list_a @ ys ) ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_9,hypothesis,
ord_less_nat @ x @ ( size_size_list_a @ ys ),
inference(split_conjunct,[status(thm)],[conj_2]) ).
thf(c_0_10,negated_conjecture,
( ( nth_a @ xs @ x )
!= ( nth_a @ ys @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP101^1 : TPTP v8.2.0. Released v7.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.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 18:19:38 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.45/0.62 # Version: 3.1.0-ho
% 0.45/0.62 # Preprocessing class: HSLSSMSSSSSNHFA.
% 0.45/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.62 # Starting new_ho_10_unif with 300s (1) cores
% 0.45/0.62 # Starting sh10 with 300s (1) cores
% 0.45/0.62 # Starting lpo5_rw_fix with 300s (1) cores
% 0.45/0.62 # sh10 with pid 23925 completed with status 0
% 0.45/0.62 # Result found by sh10
% 0.45/0.62 # Preprocessing class: HSLSSMSSSSSNHFA.
% 0.45/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.62 # Starting new_ho_10_unif with 300s (1) cores
% 0.45/0.62 # Starting sh10 with 300s (1) cores
% 0.45/0.62 # No SInE strategy applied
% 0.45/0.62 # Search class: HGHSM-FSLF32-MHFFFSBC
% 0.45/0.62 # partial match(1): HGHSM-FSLM32-MHFFFSBC
% 0.45/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.62 # Starting additional_ho_6 with 163s (1) cores
% 0.45/0.62 # additional_ho_6 with pid 23931 completed with status 0
% 0.45/0.62 # Result found by additional_ho_6
% 0.45/0.62 # Preprocessing class: HSLSSMSSSSSNHFA.
% 0.45/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.62 # Starting new_ho_10 with 1500s (5) cores
% 0.45/0.62 # Starting new_ho_10_unif with 300s (1) cores
% 0.45/0.62 # Starting sh10 with 300s (1) cores
% 0.45/0.62 # No SInE strategy applied
% 0.45/0.62 # Search class: HGHSM-FSLF32-MHFFFSBC
% 0.45/0.62 # partial match(1): HGHSM-FSLM32-MHFFFSBC
% 0.45/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.62 # Starting additional_ho_6 with 163s (1) cores
% 0.45/0.62 # Preprocessing time : 0.013 s
% 0.45/0.62 # Presaturation interreduction done
% 0.45/0.62
% 0.45/0.62 # Proof found!
% 0.45/0.62 # SZS status Theorem
% 0.45/0.62 # SZS output start CNFRefutation
% See solution above
% 0.45/0.62 # Parsed axioms : 308
% 0.45/0.62 # Removed by relevancy pruning/SinE : 0
% 0.45/0.62 # Initial clauses : 710
% 0.45/0.62 # Removed in clause preprocessing : 74
% 0.45/0.62 # Initial clauses in saturation : 636
% 0.45/0.62 # Processed clauses : 708
% 0.45/0.62 # ...of these trivial : 3
% 0.45/0.62 # ...subsumed : 184
% 0.45/0.62 # ...remaining for further processing : 521
% 0.45/0.62 # Other redundant clauses eliminated : 71
% 0.45/0.62 # Clauses deleted for lack of memory : 0
% 0.45/0.62 # Backward-subsumed : 0
% 0.45/0.62 # Backward-rewritten : 0
% 0.45/0.62 # Generated clauses : 74
% 0.45/0.62 # ...of the previous two non-redundant : 54
% 0.45/0.62 # ...aggressively subsumed : 0
% 0.45/0.62 # Contextual simplify-reflections : 1
% 0.45/0.62 # Paramodulations : 6
% 0.45/0.62 # Factorizations : 0
% 0.45/0.62 # NegExts : 0
% 0.45/0.62 # Equation resolutions : 71
% 0.45/0.62 # Disequality decompositions : 0
% 0.45/0.62 # Total rewrite steps : 34
% 0.45/0.62 # ...of those cached : 23
% 0.45/0.62 # Propositional unsat checks : 0
% 0.45/0.62 # Propositional check models : 0
% 0.45/0.62 # Propositional check unsatisfiable : 0
% 0.45/0.62 # Propositional clauses : 0
% 0.45/0.62 # Propositional clauses after purity: 0
% 0.45/0.62 # Propositional unsat core size : 0
% 0.45/0.62 # Propositional preprocessing time : 0.000
% 0.45/0.62 # Propositional encoding time : 0.000
% 0.45/0.62 # Propositional solver time : 0.000
% 0.45/0.62 # Success case prop preproc time : 0.000
% 0.45/0.62 # Success case prop encoding time : 0.000
% 0.45/0.62 # Success case prop solver time : 0.000
% 0.45/0.62 # Current number of processed clauses : 22
% 0.45/0.62 # Positive orientable unit clauses : 7
% 0.45/0.62 # Positive unorientable unit clauses: 0
% 0.45/0.62 # Negative unit clauses : 9
% 0.45/0.62 # Non-unit-clauses : 6
% 0.45/0.62 # Current number of unprocessed clauses: 413
% 0.45/0.62 # ...number of literals in the above : 1770
% 0.45/0.62 # Current number of archived formulas : 0
% 0.45/0.62 # Current number of archived clauses : 431
% 0.45/0.62 # Clause-clause subsumption calls (NU) : 77810
% 0.45/0.62 # Rec. Clause-clause subsumption calls : 14096
% 0.45/0.62 # Non-unit clause-clause subsumptions : 163
% 0.45/0.62 # Unit Clause-clause subsumption calls : 63
% 0.45/0.62 # Rewrite failures with RHS unbound : 0
% 0.45/0.62 # BW rewrite match attempts : 2
% 0.45/0.62 # BW rewrite match successes : 0
% 0.45/0.62 # Condensation attempts : 0
% 0.45/0.62 # Condensation successes : 0
% 0.45/0.62 # Termbank termtop insertions : 74666
% 0.45/0.62 # Search garbage collected termcells : 12830
% 0.45/0.62
% 0.45/0.62 # -------------------------------------------------
% 0.45/0.62 # User time : 0.123 s
% 0.45/0.62 # System time : 0.010 s
% 0.45/0.62 # Total time : 0.133 s
% 0.45/0.62 # Maximum resident set size: 4764 pages
% 0.45/0.62
% 0.45/0.62 # -------------------------------------------------
% 0.45/0.62 # User time : 0.133 s
% 0.45/0.62 # System time : 0.013 s
% 0.45/0.62 # Total time : 0.146 s
% 0.45/0.62 # Maximum resident set size: 2312 pages
% 0.45/0.62 % E---3.1 exiting
% 0.45/0.62 % E exiting
%------------------------------------------------------------------------------