%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU224+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:35:13 EDT 2022
% Result : Theorem 124.66s 124.88s
% Output : Refutation 124.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 10 unt; 6 nHn; 29 RR)
% Number of literals : 58 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc11),
file('SEU224+2.p',unknown),
[] ).
cnf(24,axiom,
relation(identity_relation(u)),
file('SEU224+2.p',unknown),
[] ).
cnf(25,axiom,
function(identity_relation(u)),
file('SEU224+2.p',unknown),
[] ).
cnf(58,axiom,
equal(relation_dom(identity_relation(u)),u),
file('SEU224+2.p',unknown),
[] ).
cnf(76,axiom,
equal(set_intersection2(u,v),set_intersection2(v,u)),
file('SEU224+2.p',unknown),
[] ).
cnf(114,axiom,
( in(skc12,skc13)
| in(skc12,relation_dom(relation_dom_restriction(skc11,skc13))) ),
file('SEU224+2.p',unknown),
[] ).
cnf(157,axiom,
( in(skc12,relation_dom(skc11))
| in(skc12,relation_dom(relation_dom_restriction(skc11,skc13))) ),
file('SEU224+2.p',unknown),
[] ).
cnf(234,axiom,
( ~ relation(u)
| equal(relation_dom(relation_dom_restriction(u,v)),set_intersection2(relation_dom(u),v)) ),
file('SEU224+2.p',unknown),
[] ).
cnf(239,axiom,
( ~ in(u,v)
| ~ equal(v,set_intersection2(w,x))
| in(u,w) ),
file('SEU224+2.p',unknown),
[] ).
cnf(261,axiom,
( ~ relation(u)
| ~ in(v,relation_dom(relation_dom_restriction(u,w)))
| in(v,w) ),
file('SEU224+2.p',unknown),
[] ).
cnf(296,axiom,
( ~ in(skc12,relation_dom(relation_dom_restriction(skc11,skc13)))
| ~ in(skc12,relation_dom(skc11))
| ~ in(skc12,skc13) ),
file('SEU224+2.p',unknown),
[] ).
cnf(313,axiom,
( ~ in(u,v)
| ~ in(u,w)
| ~ equal(x,set_intersection2(w,v))
| in(u,x) ),
file('SEU224+2.p',unknown),
[] ).
cnf(444,plain,
( ~ relation(u)
| ~ in(v,set_intersection2(relation_dom(u),w))
| in(v,w) ),
inference(rew,[status(thm),theory(equality)],[234,261]),
[iquote('0:Rew:234.1,261.1')] ).
cnf(660,plain,
equal(relation_dom(relation_dom_restriction(skc11,u)),set_intersection2(relation_dom(skc11),u)),
inference(res,[status(thm),theory(equality)],[1,234]),
[iquote('0:Res:1.0,234.0')] ).
cnf(750,plain,
( ~ in(skc12,set_intersection2(relation_dom(skc11),skc13))
| ~ in(skc12,relation_dom(skc11))
| ~ in(skc12,skc13) ),
inference(rew,[status(thm),theory(equality)],[660,296]),
[iquote('0:Rew:660.0,296.0')] ).
cnf(751,plain,
( in(skc12,relation_dom(skc11))
| in(skc12,set_intersection2(relation_dom(skc11),skc13)) ),
inference(rew,[status(thm),theory(equality)],[660,157]),
[iquote('0:Rew:660.0,157.1')] ).
cnf(752,plain,
( in(skc12,skc13)
| in(skc12,set_intersection2(relation_dom(skc11),skc13)) ),
inference(rew,[status(thm),theory(equality)],[660,114]),
[iquote('0:Rew:660.0,114.1')] ).
cnf(753,plain,
( in(skc12,skc13)
| in(skc12,set_intersection2(skc13,relation_dom(skc11))) ),
inference(rew,[status(thm),theory(equality)],[76,752]),
[iquote('0:Rew:76.0,752.1')] ).
cnf(756,plain,
( in(skc12,relation_dom(skc11))
| in(skc12,set_intersection2(skc13,relation_dom(skc11))) ),
inference(rew,[status(thm),theory(equality)],[76,751]),
[iquote('0:Rew:76.0,751.1')] ).
cnf(765,plain,
( ~ in(skc12,skc13)
| ~ in(skc12,relation_dom(skc11))
| ~ in(skc12,set_intersection2(skc13,relation_dom(skc11))) ),
inference(rew,[status(thm),theory(equality)],[76,750]),
[iquote('0:Rew:76.0,750.0')] ).
cnf(8584,plain,
( ~ relation(identity_relation(u))
| ~ in(v,set_intersection2(u,w))
| in(v,w) ),
inference(spl,[status(thm),theory(equality)],[58,444]),
[iquote('0:SpL:58.0,444.1')] ).
cnf(8631,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,w) ),
inference(ssi,[status(thm)],[8584,25,24]),
[iquote('0:SSi:8584.0,25.0,24.0')] ).
cnf(8828,plain,
( ~ in(u,set_intersection2(v,w))
| in(u,v) ),
inference(eqr,[status(thm),theory(equality)],[239]),
[iquote('0:EqR:239.1')] ).
cnf(12763,plain,
( ~ in(u,v)
| ~ in(u,w)
| in(u,set_intersection2(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[313]),
[iquote('0:EqR:313.2')] ).
cnf(63211,plain,
in(skc12,skc13),
inference(mrr,[status(thm)],[753,8828]),
[iquote('0:MRR:753.1,8828.0')] ).
cnf(63218,plain,
in(skc12,relation_dom(skc11)),
inference(mrr,[status(thm)],[756,8631]),
[iquote('0:MRR:756.1,8631.0')] ).
cnf(63352,plain,
~ in(skc12,set_intersection2(skc13,relation_dom(skc11))),
inference(mrr,[status(thm)],[765,8828,8631]),
[iquote('0:MRR:765.0,765.1,8828.1,8631.1')] ).
cnf(63733,plain,
( ~ in(skc12,relation_dom(skc11))
| ~ in(skc12,skc13) ),
inference(res,[status(thm),theory(equality)],[12763,63352]),
[iquote('0:Res:12763.2,63352.0')] ).
cnf(63734,plain,
$false,
inference(mrr,[status(thm)],[63733,63218,63211]),
[iquote('0:MRR:63733.0,63733.1,63218.0,63211.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU224+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 : Sun Jun 19 12:42:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 124.66/124.88
% 124.66/124.88 SPASS V 3.9
% 124.66/124.88 SPASS beiseite: Proof found.
% 124.66/124.88 % SZS status Theorem
% 124.66/124.88 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 124.66/124.88 SPASS derived 51771 clauses, backtracked 3088 clauses, performed 10 splits and kept 21413 clauses.
% 124.66/124.88 SPASS allocated 149318 KBytes.
% 124.66/124.88 SPASS spent 0:02:02.39 on the problem.
% 124.66/124.88 0:00:00.04 for the input.
% 124.66/124.88 0:00:03.16 for the FLOTTER CNF translation.
% 124.66/124.88 0:00:01.07 for inferences.
% 124.66/124.88 0:00:03.02 for the backtracking.
% 124.66/124.88 0:1:53.70 for the reduction.
% 124.66/124.88
% 124.66/124.88
% 124.66/124.88 Here is a proof with depth 2, length 29 :
% 124.66/124.88 % SZS output start Refutation
% See solution above
% 124.66/124.89 Formulae used in the proof : l82_funct_1 fc2_funct_1 t71_relat_1 commutativity_k3_xboole_0 t90_relat_1 d3_xboole_0 t86_relat_1
% 124.66/124.89
%------------------------------------------------------------------------------