%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI723_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n027.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:46 EDT 2022
% Result : Theorem 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 12 unt; 2 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 2 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 5 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ isint(skc1),
file('ARI723=1.p',unknown),
[] ).
cnf(2,axiom,
equal(ceiling(skc1),floor(skc1)),
file('ARI723=1.p',unknown),
[] ).
cnf(15,axiom,
( equal(U,V)
| less(V,U)
| less(U,V) ),
file('ARI723=1.p',unknown),
[] ).
cnf(34,axiom,
isint(floor(U)),
file('ARI723=1.p',unknown),
[] ).
cnf(36,axiom,
lesseq(floor(U),U),
file('ARI723=1.p',unknown),
[] ).
cnf(37,axiom,
lesseq(U,ceiling(U)),
file('ARI723=1.p',unknown),
[] ).
cnf(58,plain,
lesseq(skc1,floor(skc1)),
inference(spr,[status(thm),theory(equality)],[2,37]),
[iquote('0:SpR:2.0,37.0')] ).
cnf(69,plain,
( equal(floor(skc1),skc1)
| less(skc1,floor(skc1)) ),
inference(oce,[status(thm)],[58,15]),
[iquote('0:OCE:58.0,15.2')] ).
cnf(77,plain,
equal(floor(skc1),skc1),
inference(spt,[spt(split,[position(s1)])],[69]),
[iquote('1:Spt:69.0')] ).
cnf(90,plain,
isint(skc1),
inference(spr,[status(thm),theory(equality)],[77,34]),
[iquote('1:SpR:77.0,34.0')] ).
cnf(99,plain,
$false,
inference(mrr,[status(thm)],[90,1]),
[iquote('1:MRR:90.0,1.0')] ).
cnf(100,plain,
~ equal(floor(skc1),skc1),
inference(spt,[spt(split,[position(sa)])],[99,77]),
[iquote('1:Spt:99.0,69.0,77.0')] ).
cnf(101,plain,
less(skc1,floor(skc1)),
inference(spt,[spt(split,[position(s2)])],[69]),
[iquote('1:Spt:99.0,69.1')] ).
cnf(109,plain,
$false,
inference(oce,[status(thm)],[101,36]),
[iquote('1:OCE:101.0,36.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI723_1 : TPTP v8.1.0. Released v6.3.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n027.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:27:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % Using real theory
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS status Theorem for /tmp/SPASST_21249_n027.cluster.edu
% 0.45/1.07
% 0.45/1.07 SPASS V 2.2.22 in combination with yices.
% 0.45/1.07 SPASS beiseite: Proof found by SPASS.
% 0.45/1.07 Problem: /tmp/SPASST_21249_n027.cluster.edu
% 0.45/1.07 SPASS derived 51 clauses, backtracked 13 clauses and kept 94 clauses.
% 0.45/1.07 SPASS backtracked 2 times (0 times due to theory inconsistency).
% 0.45/1.07 SPASS allocated 6265 KBytes.
% 0.45/1.07 SPASS spent 0:00:00.01 on the problem.
% 0.45/1.07 0:00:00.00 for the input.
% 0.45/1.07 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/1.07 0:00:00.00 for inferences.
% 0.45/1.07 0:00:00.00 for the backtracking.
% 0.45/1.07 0:00:00.00 for the reduction.
% 0.45/1.07 0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS output start CNFRefutation for /tmp/SPASST_21249_n027.cluster.edu
% See solution above
% 0.45/1.07
% 0.45/1.07 Formulae used in the proof : fof_prove
% 0.80/1.09
% 0.80/1.09 SPASS+T ended
%------------------------------------------------------------------------------