TSTP Solution File: ARI608_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : ARI608_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n024.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:18 EDT 2022
% Result : Theorem 0.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 1 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
lesseq(a,b),
file('ARI608=1.p',unknown),
[] ).
cnf(6,axiom,
less(b,c),
file('ARI608=1.p',unknown),
[] ).
cnf(7,axiom,
~ lesseq(f(a),f(c)),
file('ARI608=1.p',unknown),
[] ).
cnf(8,axiom,
( ~ lesseq(U,V)
| lesseq(f(U),f(V)) ),
file('ARI608=1.p',unknown),
[] ).
cnf(40,plain,
less(f(c),f(a)),
inference(toc,[status(thm)],[7]),
[iquote('0:TOC:7.0')] ).
cnf(41,plain,
( less(U,V)
| lesseq(f(V),f(U)) ),
inference(toc,[status(thm)],[8]),
[iquote('0:TOC:8.0')] ).
cnf(52,plain,
less(c,a),
inference(oce,[status(thm)],[41,40]),
[iquote('0:OCE:41.1,40.0')] ).
cnf(66,plain,
less(b,a),
inference(och,[status(thm)],[6,52]),
[iquote('0:OCh:6.0,52.0')] ).
cnf(68,plain,
$false,
inference(oce,[status(thm)],[66,5]),
[iquote('0:OCE:66.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI608_1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n024.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 13:53:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % Using integer theory
% 0.45/1.01
% 0.45/1.01
% 0.45/1.01 % SZS status Theorem for /tmp/SPASST_26000_n024.cluster.edu
% 0.45/1.01
% 0.45/1.01 SPASS V 2.2.22 in combination with yices.
% 0.45/1.01 SPASS beiseite: Proof found by SPASS.
% 0.45/1.01 Problem: /tmp/SPASST_26000_n024.cluster.edu
% 0.45/1.01 SPASS derived 27 clauses, backtracked 4 clauses and kept 50 clauses.
% 0.45/1.01 SPASS backtracked 2 times (0 times due to theory inconsistency).
% 0.45/1.01 SPASS allocated 6228 KBytes.
% 0.45/1.01 SPASS spent 0:00:00.01 on the problem.
% 0.45/1.01 0:00:00.00 for the input.
% 0.45/1.01 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/1.01 0:00:00.00 for inferences.
% 0.45/1.01 0:00:00.00 for the backtracking.
% 0.45/1.01 0:00:00.00 for the reduction.
% 0.45/1.01 0:00:00.00 for interacting with the SMT procedure.
% 0.45/1.01
% 0.45/1.01
% 0.45/1.01 % SZS output start CNFRefutation for /tmp/SPASST_26000_n024.cluster.edu
% See solution above
% 0.45/1.01
% 0.45/1.01 Formulae used in the proof : fof_f_type fof_f_mon_implies_trans
% 0.75/1.03
% 0.75/1.03 SPASS+T ended
%------------------------------------------------------------------------------