%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n005.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 : 300s
% DateTime : Sun Apr 6 10:09:27 AM UTC 2025
% Result : Theorem 0.94s 1.22s
% Output : Refutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 11
% Syntax : Number of clauses : 12 ( 9 unt; 2 nHn; 12 RR)
% Number of literals : 26 ( 0 equ; 14 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
in_cover(skc7),
file('SWX000_1.p',unknown),
[] ).
cnf(7,axiom,
general(skc7),
file('SWX000_1.p',unknown),
[] ).
cnf(8,axiom,
in_cover(skc6),
file('SWX000_1.p',unknown),
[] ).
cnf(9,axiom,
general(skc6),
file('SWX000_1.p',unknown),
[] ).
cnf(10,axiom,
general(skc5),
file('SWX000_1.p',unknown),
[] ).
cnf(16,axiom,
s(skc5,skc7),
file('SWX000_1.p',unknown),
[] ).
cnf(17,axiom,
s(skc5,skc6),
file('SWX000_1.p',unknown),
[] ).
cnf(20,axiom,
~ equal(skc7,skc6),
file('SWX000_1.p',unknown),
[] ).
cnf(38,axiom,
( ~ general(U)
| ~ general(V)
| p__less_equal__(U,V)
| p__less_equal__(V,U) ),
file('SWX000_1.p',unknown),
[] ).
cnf(52,axiom,
( ~ general(U)
| ~ general(V)
| ~ p__less_equal__(U,V)
| equal(U,V)
| p__less__(U,V) ),
file('SWX000_1.p',unknown),
[] ).
cnf(55,axiom,
( ~ in_cover(U)
| ~ general(U)
| ~ in_cover(V)
| ~ general(V)
| ~ general(W)
| ~ p__less__(U,V)
| ~ s(W,U)
| ~ s(W,V) ),
file('SWX000_1.p',unknown),
[] ).
cnf(882,plain,
$false,
inference(thr,[status(thm)],[55,52,38,20,17,16,10,9,8,7,6]),
[iquote('0:ThR:55,52,38,20,17,16,10,9,8,7,6')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% 0.07/0.13 % Command : spasst-tptp-script %s %d
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Apr 6 02:57:57 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.21/0.49 % Using integer theory
% 0.94/1.22
% 0.94/1.22
% 0.94/1.22 % SZS status Theorem for /tmp/SPASST_16017_n005.cluster.edu
% 0.94/1.22
% 0.94/1.22 SPASS V 2.2.22 in combination with yices.
% 0.94/1.22 SPASS beiseite: Proof found by SPASS and SMT.
% 0.94/1.22 Problem: /tmp/SPASST_16017_n005.cluster.edu
% 0.94/1.22 SPASS derived 565 clauses, backtracked 125 clauses and kept 430 clauses.
% 0.94/1.22 SPASS backtracked 3 times (1 times due to theory inconsistency).
% 0.94/1.22 SPASS allocated 6732 KBytes.
% 0.94/1.22 SPASS spent 0:00:00.05 on the problem.
% 0.94/1.22 0:00:00.00 for the input.
% 0.94/1.22 0:00:00.00 for the FLOTTER CNF translation.
% 0.94/1.22 0:00:00.00 for inferences.
% 0.94/1.22 0:00:00.00 for the backtracking.
% 0.94/1.22 0:00:00.02 for the reduction.
% 0.94/1.22 0:00:00.01 for interacting with the SMT procedure.
% 0.94/1.22
% 0.94/1.22
% 0.94/1.22 % SZS output start CNFRefutation for /tmp/SPASST_16017_n005.cluster.edu
% See solution above
% 0.94/1.22
% 0.94/1.22 Formulae used in the proof : fof_general_type fof_formula_6_constraint_0 fof_f__integer___decl fof_minimal_element_ax fof_formula_4_constraint_1 fof_p__greater__def_ax fof_transitive_ordering_ax
% 0.94/1.22
% 0.94/1.22 SPASS+T ended
%------------------------------------------------------------------------------