%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 : Tue Jul 19 14:34:08 EDT 2022
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 6 unt; 2 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 7 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
~ subset(set_intersection2(skc5,skc4),skc5),
file('SEU127+1.p',unknown),
[] ).
cnf(9,axiom,
equal(set_intersection2(u,v),set_intersection2(v,u)),
file('SEU127+1.p',unknown),
[] ).
cnf(12,axiom,
( subset(u,v)
| in(skf2(v,u),u) ),
file('SEU127+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ in(skf2(u,v),u)
| subset(w,u) ),
file('SEU127+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ in(u,v)
| ~ equal(v,set_intersection2(w,x))
| in(u,x) ),
file('SEU127+1.p',unknown),
[] ).
cnf(22,plain,
~ subset(set_intersection2(skc4,skc5),skc5),
inference(rew,[status(thm),theory(equality)],[9,7]),
[iquote('0:Rew:9.0,7.0')] ).
cnf(24,plain,
~ in(skf2(skc5,u),skc5),
inference(res,[status(thm),theory(equality)],[13,22]),
[iquote('0:Res:13.1,22.0')] ).
cnf(62,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,w) ),
inference(eqr,[status(thm),theory(equality)],[17]),
[iquote('0:EqR:17.1')] ).
cnf(80,plain,
( subset(set_intersection2(u,v),w)
| in(skf2(w,set_intersection2(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[12,62]),
[iquote('0:Res:12.1,62.0')] ).
cnf(372,plain,
subset(set_intersection2(u,skc5),skc5),
inference(res,[status(thm),theory(equality)],[80,24]),
[iquote('0:Res:80.1,24.0')] ).
cnf(382,plain,
$false,
inference(unc,[status(thm)],[372,22]),
[iquote('0:UnC:372.0,22.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 10:29:14 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.47
% 0.18/0.47 SPASS V 3.9
% 0.18/0.47 SPASS beiseite: Proof found.
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 SPASS derived 310 clauses, backtracked 0 clauses, performed 0 splits and kept 166 clauses.
% 0.18/0.47 SPASS allocated 97904 KBytes.
% 0.18/0.47 SPASS spent 0:00:00.13 on the problem.
% 0.18/0.47 0:00:00.04 for the input.
% 0.18/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.47 0:00:00.00 for inferences.
% 0.18/0.47 0:00:00.00 for the backtracking.
% 0.18/0.47 0:00:00.03 for the reduction.
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Here is a proof with depth 3, length 11 :
% 0.18/0.47 % SZS output start Refutation
% See solution above
% 0.18/0.47 Formulae used in the proof : t17_xboole_1 commutativity_k3_xboole_0 d3_tarski d3_xboole_0
% 0.18/0.47
%------------------------------------------------------------------------------