TSTP Solution File: REL003+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n013.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:12:25 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 64 ( 63 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 54 ( 20 ~; 14 |; 13 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(subsumption_resolution,[],[f76,f80]) ).
fof(f80,plain,
converse(sK1) != join(converse(sK1),converse(sK0)),
inference(superposition,[],[f79,f38]) ).
fof(f38,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
fof(f79,plain,
converse(sK1) != join(converse(sK0),converse(sK1)),
inference(trivial_inequality_removal,[],[f75]) ).
fof(f75,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| sK1 != sK1 ),
inference(backward_demodulation,[],[f45,f62]) ).
fof(f62,plain,
sK1 = join(sK1,sK0),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f56,plain,
( sK1 = join(sK1,sK0)
| sK1 = join(sK1,sK0) ),
inference(superposition,[],[f54,f38]) ).
fof(f54,plain,
( sK1 = join(sK0,sK1)
| sK1 = join(sK1,sK0) ),
inference(forward_demodulation,[],[f53,f36]) ).
fof(f36,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).
fof(f53,plain,
( sK1 = join(sK1,sK0)
| sK1 = join(converse(converse(sK0)),sK1) ),
inference(forward_demodulation,[],[f48,f36]) ).
fof(f48,plain,
( sK1 = join(sK1,sK0)
| converse(converse(sK1)) = join(converse(converse(sK0)),converse(converse(sK1))) ),
inference(superposition,[],[f43,f44]) ).
fof(f44,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| sK1 = join(sK1,sK0) ),
inference(forward_demodulation,[],[f32,f38]) ).
fof(f32,plain,
( sK1 = join(sK0,sK1)
| converse(sK1) = join(converse(sK0),converse(sK1)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( ( converse(sK1) != join(converse(sK0),converse(sK1))
& sK1 = join(sK0,sK1) )
| ( sK1 != join(sK0,sK1)
& converse(sK1) = join(converse(sK0),converse(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 )
| ( join(X0,X1) != X1
& converse(X1) = join(converse(X0),converse(X1)) ) )
=> ( ( converse(sK1) != join(converse(sK0),converse(sK1))
& sK1 = join(sK0,sK1) )
| ( sK1 != join(sK0,sK1)
& converse(sK1) = join(converse(sK0),converse(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1] :
( ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 )
| ( join(X0,X1) != X1
& converse(X1) = join(converse(X0),converse(X1)) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
? [X1,X0] :
( ( converse(X0) != join(converse(X1),converse(X0))
& join(X1,X0) = X0 )
| ( join(X1,X0) != X0
& converse(X0) = join(converse(X1),converse(X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X1,X0] :
( ( join(X1,X0) = X0
=> converse(X0) = join(converse(X1),converse(X0)) )
& ( converse(X0) = join(converse(X1),converse(X0))
=> join(X1,X0) = X0 ) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X1,X0] :
( ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) )
& ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X1,X0] :
( ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) )
& ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f43,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X0] : join(converse(X1),converse(X0)) = converse(join(X1,X0)),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).
fof(f45,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| sK1 != join(sK1,sK0) ),
inference(forward_demodulation,[],[f35,f38]) ).
fof(f35,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| sK1 != join(sK0,sK1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f76,plain,
converse(sK1) = join(converse(sK1),converse(sK0)),
inference(superposition,[],[f43,f62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n013.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:26:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 % (17168)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.46 % (17168)First to succeed.
% 0.19/0.46 % (17168)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (17168)------------------------------
% 0.19/0.46 % (17168)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (17168)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (17168)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (17168)Memory used [KB]: 1535
% 0.19/0.46 % (17168)Time elapsed: 0.076 s
% 0.19/0.46 % (17168)Instructions burned: 4 (million)
% 0.19/0.46 % (17168)------------------------------
% 0.19/0.46 % (17168)------------------------------
% 0.19/0.46 % (17162)Success in time 0.11 s
%------------------------------------------------------------------------------