TSTP Solution File: SET951+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 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 : Wed Aug 31 18:26:11 EDT 2022
% Result : Theorem 1.52s 0.55s
% Output : Refutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 22 unt; 0 def)
% Number of atoms : 304 ( 98 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 375 ( 148 ~; 132 |; 82 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 239 ( 197 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f530,plain,
$false,
inference(subsumption_resolution,[],[f528,f464]) ).
fof(f464,plain,
~ in(sK9(sK1,sK3,sK0),sK2),
inference(resolution,[],[f462,f354]) ).
fof(f354,plain,
( ~ in(sK10(sK1,sK3,sK0),sK4)
| ~ in(sK9(sK1,sK3,sK0),sK2) ),
inference(subsumption_resolution,[],[f353,f117]) ).
fof(f117,plain,
in(sK9(sK1,sK3,sK0),sK3),
inference(resolution,[],[f83,f108]) ).
fof(f108,plain,
in(sK0,cartesian_product2(sK1,sK3)),
inference(resolution,[],[f86,f90]) ).
fof(f90,plain,
in(sK0,set_intersection2(cartesian_product2(sK1,sK3),cartesian_product2(sK4,sK2))),
inference(forward_demodulation,[],[f49,f48]) ).
fof(f48,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f49,plain,
in(sK0,set_intersection2(cartesian_product2(sK4,sK2),cartesian_product2(sK1,sK3))),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ! [X5,X6] :
( ~ in(X6,set_intersection2(sK2,sK3))
| ~ in(X5,set_intersection2(sK4,sK1))
| ordered_pair(X5,X6) != sK0 )
& in(sK0,set_intersection2(cartesian_product2(sK4,sK2),cartesian_product2(sK1,sK3))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f25,f26]) ).
fof(f26,plain,
( ? [X0,X1,X2,X3,X4] :
( ! [X5,X6] :
( ~ in(X6,set_intersection2(X2,X3))
| ~ in(X5,set_intersection2(X4,X1))
| ordered_pair(X5,X6) != X0 )
& in(X0,set_intersection2(cartesian_product2(X4,X2),cartesian_product2(X1,X3))) )
=> ( ! [X6,X5] :
( ~ in(X6,set_intersection2(sK2,sK3))
| ~ in(X5,set_intersection2(sK4,sK1))
| ordered_pair(X5,X6) != sK0 )
& in(sK0,set_intersection2(cartesian_product2(sK4,sK2),cartesian_product2(sK1,sK3))) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0,X1,X2,X3,X4] :
( ! [X5,X6] :
( ~ in(X6,set_intersection2(X2,X3))
| ~ in(X5,set_intersection2(X4,X1))
| ordered_pair(X5,X6) != X0 )
& in(X0,set_intersection2(cartesian_product2(X4,X2),cartesian_product2(X1,X3))) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
? [X2,X0,X1,X3,X4] :
( ! [X5,X6] :
( ~ in(X6,set_intersection2(X1,X3))
| ~ in(X5,set_intersection2(X4,X0))
| ordered_pair(X5,X6) != X2 )
& in(X2,set_intersection2(cartesian_product2(X4,X1),cartesian_product2(X0,X3))) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X4,X3,X1,X2,X0] :
~ ( ! [X5,X6] :
~ ( in(X5,set_intersection2(X4,X0))
& in(X6,set_intersection2(X1,X3))
& ordered_pair(X5,X6) = X2 )
& in(X2,set_intersection2(cartesian_product2(X4,X1),cartesian_product2(X0,X3))) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X3,X2,X0,X4,X1] :
~ ( ! [X5,X6] :
~ ( ordered_pair(X5,X6) = X0
& in(X5,set_intersection2(X1,X3))
& in(X6,set_intersection2(X2,X4)) )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X3,X2,X0,X4,X1] :
~ ( ! [X5,X6] :
~ ( ordered_pair(X5,X6) = X0
& in(X5,set_intersection2(X1,X3))
& in(X6,set_intersection2(X2,X4)) )
& in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(f86,plain,
! [X2,X0,X4] :
( ~ in(X4,set_intersection2(X0,X2))
| in(X4,X0) ),
inference(equality_resolution,[],[f65]) ).
fof(f65,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X2) = X1
| ( ( ~ in(sK11(X0,X1,X2),X1)
| ~ in(sK11(X0,X1,X2),X0)
| ~ in(sK11(X0,X1,X2),X2) )
& ( in(sK11(X0,X1,X2),X1)
| ( in(sK11(X0,X1,X2),X0)
& in(sK11(X0,X1,X2),X2) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X0)
& in(X4,X2) )
| ~ in(X4,X1) )
& ( in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) ) )
| set_intersection2(X0,X2) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f40,f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( in(X3,X1)
| ( in(X3,X0)
& in(X3,X2) ) ) )
=> ( ( ~ in(sK11(X0,X1,X2),X1)
| ~ in(sK11(X0,X1,X2),X0)
| ~ in(sK11(X0,X1,X2),X2) )
& ( in(sK11(X0,X1,X2),X1)
| ( in(sK11(X0,X1,X2),X0)
& in(sK11(X0,X1,X2),X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X2) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( in(X3,X1)
| ( in(X3,X0)
& in(X3,X2) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X0)
& in(X4,X2) )
| ~ in(X4,X1) )
& ( in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) ) )
| set_intersection2(X0,X2) != X1 ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X0,X2,X1] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X0,X2,X1] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X2,X1] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f83,plain,
! [X2,X1,X8] :
( ~ in(X8,cartesian_product2(X1,X2))
| in(sK9(X1,X2,X8),X2) ),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X2,X0,X1,X8] :
( in(sK9(X1,X2,X8),X2)
| ~ in(X8,X0)
| cartesian_product2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X1,X2) = X0
| ( ( ! [X4,X5] :
( ~ in(X4,X2)
| sK6(X0,X1,X2) != ordered_pair(X5,X4)
| ~ in(X5,X1) )
| ~ in(sK6(X0,X1,X2),X0) )
& ( ( in(sK7(X0,X1,X2),X2)
& sK6(X0,X1,X2) = ordered_pair(sK8(X0,X1,X2),sK7(X0,X1,X2))
& in(sK8(X0,X1,X2),X1) )
| in(sK6(X0,X1,X2),X0) ) ) )
& ( ! [X8] :
( ( in(X8,X0)
| ! [X9,X10] :
( ~ in(X9,X2)
| ordered_pair(X10,X9) != X8
| ~ in(X10,X1) ) )
& ( ( in(sK9(X1,X2,X8),X2)
& ordered_pair(sK10(X1,X2,X8),sK9(X1,X2,X8)) = X8
& in(sK10(X1,X2,X8),X1) )
| ~ in(X8,X0) ) )
| cartesian_product2(X1,X2) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f33,f36,f35,f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X2)
| ordered_pair(X5,X4) != X3
| ~ in(X5,X1) )
| ~ in(X3,X0) )
& ( ? [X6,X7] :
( in(X6,X2)
& ordered_pair(X7,X6) = X3
& in(X7,X1) )
| in(X3,X0) ) )
=> ( ( ! [X5,X4] :
( ~ in(X4,X2)
| sK6(X0,X1,X2) != ordered_pair(X5,X4)
| ~ in(X5,X1) )
| ~ in(sK6(X0,X1,X2),X0) )
& ( ? [X7,X6] :
( in(X6,X2)
& ordered_pair(X7,X6) = sK6(X0,X1,X2)
& in(X7,X1) )
| in(sK6(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ? [X7,X6] :
( in(X6,X2)
& ordered_pair(X7,X6) = sK6(X0,X1,X2)
& in(X7,X1) )
=> ( in(sK7(X0,X1,X2),X2)
& sK6(X0,X1,X2) = ordered_pair(sK8(X0,X1,X2),sK7(X0,X1,X2))
& in(sK8(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X1,X2,X8] :
( ? [X11,X12] :
( in(X11,X2)
& ordered_pair(X12,X11) = X8
& in(X12,X1) )
=> ( in(sK9(X1,X2,X8),X2)
& ordered_pair(sK10(X1,X2,X8),sK9(X1,X2,X8)) = X8
& in(sK10(X1,X2,X8),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X1,X2) = X0
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X2)
| ordered_pair(X5,X4) != X3
| ~ in(X5,X1) )
| ~ in(X3,X0) )
& ( ? [X6,X7] :
( in(X6,X2)
& ordered_pair(X7,X6) = X3
& in(X7,X1) )
| in(X3,X0) ) ) )
& ( ! [X8] :
( ( in(X8,X0)
| ! [X9,X10] :
( ~ in(X9,X2)
| ordered_pair(X10,X9) != X8
| ~ in(X10,X1) ) )
& ( ? [X11,X12] :
( in(X11,X2)
& ordered_pair(X12,X11) = X8
& in(X12,X1) )
| ~ in(X8,X0) ) )
| cartesian_product2(X1,X2) != X0 ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X1)
| ordered_pair(X5,X4) != X3
| ~ in(X5,X0) )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( in(X4,X1)
& ordered_pair(X5,X4) = X3
& in(X5,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ~ in(X4,X1)
| ordered_pair(X5,X4) != X3
| ~ in(X5,X0) ) )
& ( ? [X4,X5] :
( in(X4,X1)
& ordered_pair(X5,X4) = X3
& in(X5,X0) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( in(X4,X1)
& ordered_pair(X5,X4) = X3
& in(X5,X0) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( ? [X5,X4] :
( in(X5,X1)
& ordered_pair(X4,X5) = X3
& in(X4,X0) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f353,plain,
( ~ in(sK10(sK1,sK3,sK0),sK4)
| ~ in(sK9(sK1,sK3,sK0),sK2)
| ~ in(sK9(sK1,sK3,sK0),sK3) ),
inference(resolution,[],[f352,f88]) ).
fof(f88,plain,
! [X2,X0,X4] :
( in(X4,set_intersection2(X0,X2))
| ~ in(X4,X2)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f63]) ).
fof(f63,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f42]) ).
fof(f352,plain,
( ~ in(sK9(sK1,sK3,sK0),set_intersection2(sK2,sK3))
| ~ in(sK10(sK1,sK3,sK0),sK4) ),
inference(subsumption_resolution,[],[f351,f120]) ).
fof(f120,plain,
in(sK10(sK1,sK3,sK0),sK1),
inference(resolution,[],[f85,f108]) ).
fof(f85,plain,
! [X2,X1,X8] :
( ~ in(X8,cartesian_product2(X1,X2))
| in(sK10(X1,X2,X8),X1) ),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X2,X0,X1,X8] :
( in(sK10(X1,X2,X8),X1)
| ~ in(X8,X0)
| cartesian_product2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f37]) ).
fof(f351,plain,
( ~ in(sK10(sK1,sK3,sK0),sK1)
| ~ in(sK9(sK1,sK3,sK0),set_intersection2(sK2,sK3))
| ~ in(sK10(sK1,sK3,sK0),sK4) ),
inference(resolution,[],[f253,f88]) ).
fof(f253,plain,
( ~ in(sK10(sK1,sK3,sK0),set_intersection2(sK1,sK4))
| ~ in(sK9(sK1,sK3,sK0),set_intersection2(sK2,sK3)) ),
inference(forward_demodulation,[],[f247,f48]) ).
fof(f247,plain,
( ~ in(sK10(sK1,sK3,sK0),set_intersection2(sK4,sK1))
| ~ in(sK9(sK1,sK3,sK0),set_intersection2(sK2,sK3)) ),
inference(trivial_inequality_removal,[],[f235]) ).
fof(f235,plain,
( ~ in(sK9(sK1,sK3,sK0),set_intersection2(sK2,sK3))
| sK0 != sK0
| ~ in(sK10(sK1,sK3,sK0),set_intersection2(sK4,sK1)) ),
inference(superposition,[],[f73,f201]) ).
fof(f201,plain,
unordered_pair(unordered_pair(sK10(sK1,sK3,sK0),sK9(sK1,sK3,sK0)),singleton(sK10(sK1,sK3,sK0))) = sK0,
inference(resolution,[],[f84,f108]) ).
fof(f84,plain,
! [X2,X1,X8] :
( ~ in(X8,cartesian_product2(X1,X2))
| unordered_pair(unordered_pair(sK10(X1,X2,X8),sK9(X1,X2,X8)),singleton(sK10(X1,X2,X8))) = X8 ),
inference(equality_resolution,[],[f78]) ).
fof(f78,plain,
! [X2,X0,X1,X8] :
( unordered_pair(unordered_pair(sK10(X1,X2,X8),sK9(X1,X2,X8)),singleton(sK10(X1,X2,X8))) = X8
| ~ in(X8,X0)
| cartesian_product2(X1,X2) != X0 ),
inference(definition_unfolding,[],[f56,f47]) ).
fof(f47,plain,
! [X0,X1] : ordered_pair(X1,X0) = unordered_pair(unordered_pair(X1,X0),singleton(X1)),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] : ordered_pair(X1,X0) = unordered_pair(unordered_pair(X1,X0),singleton(X1)),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f56,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK10(X1,X2,X8),sK9(X1,X2,X8)) = X8
| ~ in(X8,X0)
| cartesian_product2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f37]) ).
fof(f73,plain,
! [X6,X5] :
( unordered_pair(unordered_pair(X5,X6),singleton(X5)) != sK0
| ~ in(X5,set_intersection2(sK4,sK1))
| ~ in(X6,set_intersection2(sK2,sK3)) ),
inference(definition_unfolding,[],[f50,f47]) ).
fof(f50,plain,
! [X6,X5] :
( ~ in(X6,set_intersection2(sK2,sK3))
| ~ in(X5,set_intersection2(sK4,sK1))
| ordered_pair(X5,X6) != sK0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f462,plain,
in(sK10(sK1,sK3,sK0),sK4),
inference(superposition,[],[f121,f388]) ).
fof(f388,plain,
sK10(sK4,sK2,sK0) = sK10(sK1,sK3,sK0),
inference(trivial_inequality_removal,[],[f364]) ).
fof(f364,plain,
( sK10(sK4,sK2,sK0) = sK10(sK1,sK3,sK0)
| sK0 != sK0 ),
inference(superposition,[],[f233,f202]) ).
fof(f202,plain,
unordered_pair(unordered_pair(sK10(sK4,sK2,sK0),sK9(sK4,sK2,sK0)),singleton(sK10(sK4,sK2,sK0))) = sK0,
inference(resolution,[],[f84,f113]) ).
fof(f113,plain,
in(sK0,cartesian_product2(sK4,sK2)),
inference(resolution,[],[f87,f90]) ).
fof(f87,plain,
! [X2,X0,X4] :
( ~ in(X4,set_intersection2(X0,X2))
| in(X4,X2) ),
inference(equality_resolution,[],[f64]) ).
fof(f64,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f42]) ).
fof(f233,plain,
! [X4,X5] :
( unordered_pair(unordered_pair(X4,X5),singleton(X4)) != sK0
| sK10(sK1,sK3,sK0) = X4 ),
inference(superposition,[],[f79,f201]) ).
fof(f79,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) != unordered_pair(unordered_pair(X1,X0),singleton(X1))
| X1 = X2 ),
inference(definition_unfolding,[],[f70,f47,f47]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( X1 = X2
| ordered_pair(X2,X3) != ordered_pair(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( ( X1 = X2
& X0 = X3 )
| ordered_pair(X2,X3) != ordered_pair(X1,X0) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X2,X0,X1,X3] :
( ( X0 = X1
& X2 = X3 )
| ordered_pair(X0,X2) != ordered_pair(X1,X3) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X3,X2] :
( ordered_pair(X0,X2) = ordered_pair(X1,X3)
=> ( X0 = X1
& X2 = X3 ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X0,X2,X1,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f121,plain,
in(sK10(sK4,sK2,sK0),sK4),
inference(resolution,[],[f85,f113]) ).
fof(f528,plain,
in(sK9(sK1,sK3,sK0),sK2),
inference(superposition,[],[f118,f390]) ).
fof(f390,plain,
sK9(sK1,sK3,sK0) = sK9(sK4,sK2,sK0),
inference(trivial_inequality_removal,[],[f363]) ).
fof(f363,plain,
( sK9(sK1,sK3,sK0) = sK9(sK4,sK2,sK0)
| sK0 != sK0 ),
inference(superposition,[],[f232,f202]) ).
fof(f232,plain,
! [X2,X3] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) != sK0
| sK9(sK1,sK3,sK0) = X3 ),
inference(superposition,[],[f80,f201]) ).
fof(f80,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) != unordered_pair(unordered_pair(X1,X0),singleton(X1))
| X0 = X3 ),
inference(definition_unfolding,[],[f69,f47,f47]) ).
fof(f69,plain,
! [X2,X3,X0,X1] :
( X0 = X3
| ordered_pair(X2,X3) != ordered_pair(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f118,plain,
in(sK9(sK4,sK2,sK0),sK2),
inference(resolution,[],[f113,f83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n005.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 : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:31:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (579)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (553)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (574)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.50 % (551)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (560)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (562)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51 % (566)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51 % (571)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (577)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.51 % (558)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (552)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (550)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (557)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52 % (557)Instruction limit reached!
% 0.20/0.52 % (557)------------------------------
% 0.20/0.52 % (557)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (557)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (557)Termination reason: Unknown
% 0.20/0.52 % (557)Termination phase: Property scanning
% 0.20/0.52
% 0.20/0.52 % (557)Memory used [KB]: 895
% 0.20/0.52 % (557)Time elapsed: 0.002 s
% 0.20/0.52 % (557)Instructions burned: 2 (million)
% 0.20/0.52 % (557)------------------------------
% 0.20/0.52 % (557)------------------------------
% 0.20/0.52 % (583)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.52 % (561)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.52 % (576)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.33/0.53 % (559)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.33/0.53 % (564)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.33/0.53 % (554)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.33/0.53 % (565)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.33/0.53 % (580)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.33/0.53 % (555)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.33/0.53 % (578)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.33/0.54 % (572)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.33/0.54 % (556)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.33/0.54 % (582)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.33/0.54 % (573)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.52/0.54 % (551)First to succeed.
% 1.52/0.55 % (567)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.52/0.55 TRYING [1]
% 1.52/0.55 TRYING [2]
% 1.52/0.55 % (551)Refutation found. Thanks to Tanya!
% 1.52/0.55 % SZS status Theorem for theBenchmark
% 1.52/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.52/0.55 % (551)------------------------------
% 1.52/0.55 % (551)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.55 % (551)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.55 % (551)Termination reason: Refutation
% 1.52/0.55
% 1.52/0.55 % (551)Memory used [KB]: 1407
% 1.52/0.55 % (551)Time elapsed: 0.145 s
% 1.52/0.55 % (551)Instructions burned: 31 (million)
% 1.52/0.55 % (551)------------------------------
% 1.52/0.55 % (551)------------------------------
% 1.52/0.55 % (546)Success in time 0.196 s
%------------------------------------------------------------------------------