TSTP Solution File: NUM892_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : NUM892_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n015.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 : Mon Jul 18 14:39:12 EDT 2022
% Result : Theorem 0.47s 1.03s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 3
% Syntax : Number of clauses : 4 ( 1 unt; 1 nHn; 4 RR)
% Number of literals : 8 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ equal(skc3,skc2)
| ~ lesseq(skc2,skc3) ),
file('NUM892=1.p',unknown),
[] ).
cnf(2,axiom,
( ~ less(skc2,skc3)
| ~ lesseq(skc2,skc3) ),
file('NUM892=1.p',unknown),
[] ).
cnf(3,axiom,
( lesseq(skc2,skc3)
| less(skc2,skc3)
| equal(skc3,skc2) ),
file('NUM892=1.p',unknown),
[] ).
cnf(38,plain,
$false,
inference(thr,[status(thm)],[3,2,1]),
[iquote('0:ThR:3,2,1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM892_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.34 % Computer : n015.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 : Tue Jul 5 17:18:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48 % Using integer theory
% 0.47/1.03
% 0.47/1.03
% 0.47/1.03 % SZS status Theorem for /tmp/SPASST_8518_n015.cluster.edu
% 0.47/1.03
% 0.47/1.03 SPASS V 2.2.22 in combination with yices.
% 0.47/1.03 SPASS beiseite: Proof found by SMT.
% 0.47/1.03 Problem: /tmp/SPASST_8518_n015.cluster.edu
% 0.47/1.03 SPASS derived 1 clauses, backtracked 0 clauses and kept 35 clauses.
% 0.47/1.03 SPASS backtracked 1 times (1 times due to theory inconsistency).
% 0.47/1.03 SPASS allocated 6209 KBytes.
% 0.47/1.03 SPASS spent 0:00:00.01 on the problem.
% 0.47/1.03 0:00:00.00 for the input.
% 0.47/1.03 0:00:00.00 for the FLOTTER CNF translation.
% 0.47/1.03 0:00:00.00 for inferences.
% 0.47/1.03 0:00:00.00 for the backtracking.
% 0.47/1.03 0:00:00.00 for the reduction.
% 0.47/1.03 0:00:00.00 for interacting with the SMT procedure.
% 0.47/1.03
% 0.47/1.03
% 0.47/1.03 % SZS output start CNFRefutation for /tmp/SPASST_8518_n015.cluster.edu
% See solution above
% 0.47/1.03
% 0.47/1.03 Formulae used in the proof : fof_less_lesseq
% 0.47/1.03
% 0.47/1.03 SPASS+T ended
%------------------------------------------------------------------------------