TSTP Solution File: ARI618_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI618_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n011.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:21 EDT 2022
% Result : Theorem 0.46s 1.11s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 8 unt; 9 nHn; 7 RR)
% Number of literals : 31 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
lesseq(U,f(U)),
file('ARI618=1.p',unknown),
[] ).
cnf(3,axiom,
lesseq(uminus(U),f(U)),
file('ARI618=1.p',unknown),
[] ).
cnf(4,axiom,
~ equal(f(f(skc1)),f(skc1)),
file('ARI618=1.p',unknown),
[] ).
cnf(5,axiom,
( lesseq(f(U),U)
| lesseq(f(U),uminus(U)) ),
file('ARI618=1.p',unknown),
[] ).
cnf(6,axiom,
equal(uminus(uminus(U)),U),
file('ARI618=1.p',unknown),
[] ).
cnf(18,axiom,
( equal(U,V)
| less(V,U)
| less(U,V) ),
file('ARI618=1.p',unknown),
[] ).
cnf(37,plain,
( equal(f(U),U)
| less(U,f(U)) ),
inference(oce,[status(thm)],[2,18]),
[iquote('0:OCE:2.0,18.1')] ).
cnf(40,plain,
( equal(f(U),uminus(U))
| less(uminus(U),f(U)) ),
inference(oce,[status(thm)],[3,18]),
[iquote('0:OCE:3.0,18.1')] ).
cnf(70,plain,
( equal(f(U),uminus(U))
| lesseq(f(U),U) ),
inference(oce,[status(thm)],[40,5]),
[iquote('0:OCE:40.1,5.1')] ).
cnf(86,plain,
( equal(f(U),uminus(U))
| equal(f(U),U) ),
inference(oce,[status(thm)],[70,37]),
[iquote('0:OCE:70.1,37.1')] ).
cnf(92,plain,
( equal(f(U),U)
| less(U,uminus(U)) ),
inference(rew,[status(thm),theory(equality)],[86,37]),
[iquote('0:Rew:86.0,37.1')] ).
cnf(97,plain,
( equal(f(uminus(U)),uminus(U))
| less(uminus(U),U) ),
inference(spr,[status(thm),theory(equality)],[6,92]),
[iquote('0:SpR:6.0,92.1')] ).
cnf(109,plain,
( ~ equal(f(uminus(skc1)),uminus(skc1))
| equal(f(skc1),skc1) ),
inference(spl,[status(thm),theory(equality)],[86,4]),
[iquote('0:SpL:86.0,4.0')] ).
cnf(205,plain,
( equal(f(uminus(U)),uminus(U))
| equal(f(U),U) ),
inference(oce,[status(thm)],[97,92]),
[iquote('0:OCE:97.1,92.1')] ).
cnf(216,plain,
( ~ equal(uminus(skc1),uminus(skc1))
| equal(f(skc1),skc1) ),
inference(rew,[status(thm),theory(equality)],[205,109]),
[iquote('0:Rew:205.0,109.0')] ).
cnf(217,plain,
equal(f(skc1),skc1),
inference(obv,[status(thm),theory(equality)],[216]),
[iquote('0:Obv:216.0')] ).
cnf(218,plain,
~ equal(f(skc1),skc1),
inference(rew,[status(thm),theory(equality)],[217,4]),
[iquote('0:Rew:217.0,4.0')] ).
cnf(220,plain,
~ equal(skc1,skc1),
inference(rew,[status(thm),theory(equality)],[217,218]),
[iquote('0:Rew:217.0,218.0')] ).
cnf(221,plain,
$false,
inference(obv,[status(thm),theory(equality)],[220]),
[iquote('0:Obv:220.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI618_1 : TPTP v8.1.0. Released v5.1.0.
% 0.07/0.13 % Command : spasst-tptp-script %s %d
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 17 14:37:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.47 % Using integer theory
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 % SZS status Theorem for /tmp/SPASST_16760_n011.cluster.edu
% 0.46/1.11
% 0.46/1.11 SPASS V 2.2.22 in combination with yices.
% 0.46/1.11 SPASS beiseite: Proof found by SPASS.
% 0.46/1.11 Problem: /tmp/SPASST_16760_n011.cluster.edu
% 0.46/1.11 SPASS derived 143 clauses, backtracked 0 clauses and kept 73 clauses.
% 0.46/1.11 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.46/1.11 SPASS allocated 6296 KBytes.
% 0.46/1.11 SPASS spent 0:00:00.02 on the problem.
% 0.46/1.11 0:00:00.00 for the input.
% 0.46/1.11 0:00:00.00 for the FLOTTER CNF translation.
% 0.46/1.11 0:00:00.00 for inferences.
% 0.46/1.11 0:00:00.00 for the backtracking.
% 0.46/1.11 0:00:00.01 for the reduction.
% 0.46/1.11 0:00:00.00 for interacting with the SMT procedure.
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 % SZS output start CNFRefutation for /tmp/SPASST_16760_n011.cluster.edu
% See solution above
% 0.46/1.11
% 0.46/1.11 Formulae used in the proof : fof_f_type fof_absolute_value_idempotent
% 0.46/1.13
% 0.46/1.13 SPASS+T ended
%------------------------------------------------------------------------------