TSTP Solution File: ARI603_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI603_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n012.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:16 EDT 2022
% Result : Theorem 0.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 8 unt; 2 nHn; 2 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
greater(f(U),U),
file('ARI603=1.p',unknown),
[] ).
cnf(3,axiom,
~ less(skc3,plus(skc2,f(U))),
file('ARI603=1.p',unknown),
[] ).
cnf(5,axiom,
equal(plus(U,plus(uminus(U),V)),V),
file('ARI603=1.p',unknown),
[] ).
cnf(18,axiom,
( lesseq(U,V)
| less(plus(W,V),plus(W,U)) ),
file('ARI603=1.p',unknown),
[] ).
cnf(35,plain,
less(U,f(U)),
inference(ars,[status(thm)],[2]),
[iquote('0:ArS:2.0')] ).
cnf(36,plain,
lesseq(plus(skc2,f(U)),skc3),
inference(toc,[status(thm)],[3]),
[iquote('0:TOC:3.0')] ).
cnf(39,plain,
( lesseq(f(U),V)
| less(plus(skc2,V),skc3) ),
inference(och,[status(thm)],[36,18]),
[iquote('0:OCh:36.0,18.1')] ).
cnf(47,plain,
less(plus(skc2,U),skc3),
inference(oce,[status(thm)],[39,35]),
[iquote('0:OCE:39.0,35.0')] ).
cnf(60,plain,
less(U,skc3),
inference(spr,[status(thm),theory(equality)],[5,47]),
[iquote('0:SpR:5.0,47.0')] ).
cnf(64,plain,
$false,
inference(bld,[status(thm)],[60]),
[iquote('0:BLD:60.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI603_1 : TPTP v8.1.0. Released v5.1.0.
% 0.07/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n012.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 : 600
% 0.13/0.34 % DateTime : Fri Jun 17 14:07:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % Using integer theory
% 0.45/1.02
% 0.45/1.02
% 0.45/1.02 % SZS status Theorem for /tmp/SPASST_32273_n012.cluster.edu
% 0.45/1.02
% 0.45/1.02 SPASS V 2.2.22 in combination with yices.
% 0.45/1.02 SPASS beiseite: Proof found by SPASS.
% 0.45/1.02 Problem: /tmp/SPASST_32273_n012.cluster.edu
% 0.45/1.02 SPASS derived 26 clauses, backtracked 0 clauses and kept 50 clauses.
% 0.45/1.02 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.45/1.02 SPASS allocated 6235 KBytes.
% 0.45/1.02 SPASS spent 0:00:00.01 on the problem.
% 0.45/1.02 0:00:00.00 for the input.
% 0.45/1.02 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/1.02 0:00:00.00 for inferences.
% 0.45/1.02 0:00:00.00 for the backtracking.
% 0.45/1.02 0:00:00.00 for the reduction.
% 0.45/1.02 0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.02
% 0.45/1.02
% 0.45/1.02 % SZS output start CNFRefutation for /tmp/SPASST_32273_n012.cluster.edu
% See solution above
% 0.45/1.02
% 0.45/1.02 Formulae used in the proof : fof_f_type fof_fX_gt_X_implies_exist_large_fX
% 0.45/1.02
% 0.45/1.02 SPASS+T ended
%------------------------------------------------------------------------------