TSTP Solution File: REL003+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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 May 1 03:39:23 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 58 ( 31 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 21 |; 4 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(avatar_sat_refutation,[],[f36,f37,f42,f54]) ).
fof(f54,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f53]) ).
fof(f53,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(subsumption_resolution,[],[f52,f34]) ).
fof(f34,plain,
( sK1 != join(sK0,sK1)
| spl2_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl2_2
<=> sK1 = join(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f52,plain,
( sK1 = join(sK0,sK1)
| ~ spl2_1 ),
inference(forward_demodulation,[],[f46,f24]) ).
fof(f24,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/tmp/tmp.h42rdpcLs5/Vampire---4.8_748',converse_idempotence) ).
fof(f46,plain,
( join(sK0,sK1) = converse(converse(sK1))
| ~ spl2_1 ),
inference(superposition,[],[f24,f43]) ).
fof(f43,plain,
( converse(sK1) = converse(join(sK0,sK1))
| ~ spl2_1 ),
inference(superposition,[],[f31,f23]) ).
fof(f23,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.h42rdpcLs5/Vampire---4.8_748',converse_additivity) ).
fof(f31,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl2_1
<=> converse(sK1) = join(converse(sK0),converse(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f42,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f41]) ).
fof(f41,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f40]) ).
fof(f40,plain,
( converse(sK1) != converse(sK1)
| spl2_1
| ~ spl2_2 ),
inference(forward_demodulation,[],[f39,f35]) ).
fof(f35,plain,
( sK1 = join(sK0,sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f39,plain,
( converse(sK1) != converse(join(sK0,sK1))
| spl2_1 ),
inference(superposition,[],[f30,f23]) ).
fof(f30,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| spl2_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f37,plain,
( ~ spl2_2
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f17,f29,f33]) ).
fof(f17,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| sK1 != join(sK0,sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X0,X1] :
( ( join(X0,X1) != X1
& converse(X1) = join(converse(X0),converse(X1)) )
| ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [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(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1] :
( ( converse(X1) = join(converse(X0),converse(X1))
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> converse(X1) = join(converse(X0),converse(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.h42rdpcLs5/Vampire---4.8_748',goals) ).
fof(f36,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f18,f33,f29]) ).
fof(f18,plain,
( sK1 = join(sK0,sK1)
| converse(sK1) = join(converse(sK0),converse(sK1)) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:17:10 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_PEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.h42rdpcLs5/Vampire---4.8_748
% 0.55/0.74 % (1053)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.55/0.74 % (1032)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.74 % (1038)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.74 % (1037)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.74 % (1033)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.55/0.74 % (1046)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.74 % (1052)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.74 % (1053)First to succeed.
% 0.55/0.74 % (1053)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for Vampire---4
% 0.55/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74 % (1053)------------------------------
% 0.55/0.74 % (1053)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74 % (1053)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (1053)Memory used [KB]: 1053
% 0.55/0.74 % (1053)Time elapsed: 0.003 s
% 0.55/0.74 % (1053)Instructions burned: 4 (million)
% 0.55/0.74 % (1053)------------------------------
% 0.55/0.74 % (1053)------------------------------
% 0.55/0.74 % (1023)Success in time 0.373 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------