TSTP Solution File: ARI605_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI605_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n005.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 : 600s
% DateTime : Thu Jul 14 22:18:17 EDT 2022
% Result : Theorem 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 7 unt; 5 nHn; 7 RR)
% Number of literals : 19 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
greater(f(U),U),
file('ARI605=1.p',unknown),
[] ).
cnf(5,axiom,
( ~ less(U,plus(f(a),f(b)))
| ~ less(plus(a,b),U) ),
file('ARI605=1.p',unknown),
[] ).
cnf(19,axiom,
( lesseq(U,V)
| less(plus(V,W),plus(U,W)) ),
file('ARI605=1.p',unknown),
[] ).
cnf(20,axiom,
( lesseq(U,V)
| less(plus(W,V),plus(W,U)) ),
file('ARI605=1.p',unknown),
[] ).
cnf(37,plain,
less(U,f(U)),
inference(ars,[status(thm)],[4]),
[iquote('0:ArS:4.0')] ).
cnf(38,plain,
( lesseq(U,plus(a,b))
| lesseq(plus(f(a),f(b)),U) ),
inference(toc,[status(thm)],[5]),
[iquote('0:TOC:5.1')] ).
cnf(44,plain,
( lesseq(plus(f(a),U),plus(a,b))
| lesseq(f(b),U) ),
inference(oce,[status(thm)],[38,20]),
[iquote('0:OCE:38.1,20.1')] ).
cnf(53,plain,
( lesseq(f(b),b)
| lesseq(f(a),a) ),
inference(oce,[status(thm)],[44,19]),
[iquote('0:OCE:44.0,19.1')] ).
cnf(57,plain,
lesseq(f(b),b),
inference(spt,[spt(split,[position(s1)])],[53]),
[iquote('1:Spt:53.0')] ).
cnf(58,plain,
$false,
inference(oce,[status(thm)],[57,37]),
[iquote('1:OCE:57.0,37.0')] ).
cnf(60,plain,
~ lesseq(f(b),b),
inference(spt,[spt(split,[position(sa)])],[58,57]),
[iquote('1:Spt:58.0,53.0,57.0')] ).
cnf(61,plain,
lesseq(f(a),a),
inference(spt,[spt(split,[position(s2)])],[53]),
[iquote('1:Spt:58.0,53.1')] ).
cnf(63,plain,
$false,
inference(oce,[status(thm)],[61,37]),
[iquote('1:OCE:61.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ARI605_1 : TPTP v8.1.0. Released v5.1.0.
% 0.11/0.12 % Command : spasst-tptp-script %s %d
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jun 17 14:20:08 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.45 % Using integer theory
% 0.43/0.99
% 0.43/0.99
% 0.43/0.99 % SZS status Theorem for /tmp/SPASST_22743_n005.cluster.edu
% 0.43/0.99
% 0.43/0.99 SPASS V 2.2.22 in combination with yices.
% 0.43/0.99 SPASS beiseite: Proof found by SPASS.
% 0.43/0.99 Problem: /tmp/SPASST_22743_n005.cluster.edu
% 0.43/0.99 SPASS derived 23 clauses, backtracked 2 clauses and kept 53 clauses.
% 0.43/0.99 SPASS backtracked 2 times (0 times due to theory inconsistency).
% 0.43/0.99 SPASS allocated 6237 KBytes.
% 0.43/0.99 SPASS spent 0:00:00.01 on the problem.
% 0.43/0.99 0:00:00.00 for the input.
% 0.43/0.99 0:00:00.00 for the FLOTTER CNF translation.
% 0.43/0.99 0:00:00.00 for inferences.
% 0.43/0.99 0:00:00.00 for the backtracking.
% 0.43/0.99 0:00:00.00 for the reduction.
% 0.43/0.99 0:00:00.00 for interacting with the SMT procedure.
% 0.43/0.99
% 0.43/0.99
% 0.43/0.99 % SZS output start CNFRefutation for /tmp/SPASST_22743_n005.cluster.edu
% See solution above
% 0.43/0.99
% 0.43/0.99 Formulae used in the proof : fof_a_type fof_fX_gt_X_implies_f_a_b
% 0.43/1.01
% 0.43/1.01 SPASS+T ended
%------------------------------------------------------------------------------