TSTP Solution File: COL091-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n008.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 : Tue Aug 22 10:35:03 EDT 2023
% Result : Unsatisfiable 3.94s 1.92s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 28
% Syntax : Number of formulae : 46 ( 12 unt; 18 typ; 0 def)
% Number of atoms : 52 ( 12 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 49 ( 25 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 12 >; 19 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 50 (; 50 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ap_contractE_c4 > ap_contractE_c3 > ap_contractE_c2 > ap_contractE_c1 > member > ap_contractE_sk3q > ap_contractE_sk2q > ap_contractE_sk1q > ap_contractE_sk1p > pair > comb_app > #nlpp > rtrancl > r > p > contract > combS > combK > comb
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: $i ).
tff(comb_app,type,
comb_app: ( $i * $i ) > $i ).
tff(ap_contractE_sk1q,type,
ap_contractE_sk1q: ( $i * $i * $i ) > $i ).
tff(ap_contractE_sk2q,type,
ap_contractE_sk2q: ( $i * $i * $i ) > $i ).
tff(rtrancl,type,
rtrancl: $i > $i ).
tff(ap_contractE_sk3q,type,
ap_contractE_sk3q: ( $i * $i * $i ) > $i ).
tff(combS,type,
combS: $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(ap_contractE_c3,type,
ap_contractE_c3: ( $i * $i * $i ) > $o ).
tff(ap_contractE_c4,type,
ap_contractE_c4: ( $i * $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(contract,type,
contract: $i ).
tff(ap_contractE_c2,type,
ap_contractE_c2: ( $i * $i * $i ) > $o ).
tff(combK,type,
combK: $i ).
tff(p,type,
p: $i ).
tff(ap_contractE_sk1p,type,
ap_contractE_sk1p: ( $i * $i * $i ) > $i ).
tff(comb,type,
comb: $i ).
tff(ap_contractE_c1,type,
ap_contractE_c1: ( $i * $i * $i ) > $o ).
tff(f_28,axiom,
! [P,Q] : ( combK != comb_app(P,Q) ),
file(unknown,unknown) ).
tff(f_150,axiom,
! [P,Q,R] :
( ~ ap_contractE_c2(P,Q,R)
| ( P = comb_app(comb_app(combS,ap_contractE_sk1p(P,Q,R)),ap_contractE_sk1q(P,Q,R)) ) ),
file(unknown,unknown) ).
tff(f_155,axiom,
! [P,Q,R] :
( ~ ap_contractE_c3(P,Q,R)
| member(pair(P,ap_contractE_sk2q(P,Q,R)),contract) ),
file(unknown,unknown) ).
tff(f_184,axiom,
! [R] : ~ member(pair(combK,R),contract),
file(unknown,unknown) ).
tff(f_180,axiom,
! [P,Q,R] :
( ~ ap_contractE_c4(P,Q,R)
| ( R = comb_app(P,ap_contractE_sk3q(P,Q,R)) ) ),
file(unknown,unknown) ).
tff(f_170,axiom,
! [P,Q,R] :
( ~ ap_contractE_c4(P,Q,R)
| member(pair(Q,ap_contractE_sk3q(P,Q,R)),contract) ),
file(unknown,unknown) ).
tff(f_196,axiom,
! [Q] :
( ( r != comb_app(combK,Q) )
| ~ member(pair(p,Q),contract) ),
file(unknown,unknown) ).
tff(f_190,axiom,
member(pair(comb_app(combK,p),r),contract),
file(unknown,unknown) ).
tff(f_110,axiom,
! [P,Q,R] :
( ~ member(pair(comb_app(P,Q),R),contract)
| ap_contractE_c1(P,Q,R)
| ap_contractE_c2(P,Q,R)
| ap_contractE_c3(P,Q,R)
| ap_contractE_c4(P,Q,R) ),
file(unknown,unknown) ).
tff(f_125,axiom,
! [P,Q,R] :
( ~ ap_contractE_c1(P,Q,R)
| ( P = comb_app(combK,R) ) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [P_1,Q_2] : ( comb_app(P_1,Q_2) != combK ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_270,plain,
! [P_190,Q_191,R_192] :
( ( comb_app(comb_app(combS,ap_contractE_sk1p(P_190,Q_191,R_192)),ap_contractE_sk1q(P_190,Q_191,R_192)) = P_190 )
| ~ ap_contractE_c2(P_190,Q_191,R_192) ),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_316,plain,
! [Q_191,R_192] : ~ ap_contractE_c2(combK,Q_191,R_192),
inference(superposition,[status(thm),theory(equality)],[c_270,c_4]) ).
tff(c_234,plain,
! [P_171,Q_172,R_173] :
( member(pair(P_171,ap_contractE_sk2q(P_171,Q_172,R_173)),contract)
| ~ ap_contractE_c3(P_171,Q_172,R_173) ),
inference(cnfTransformation,[status(thm)],[f_155]) ).
tff(c_61,plain,
! [R_74] : ~ member(pair(combK,R_74),contract),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_249,plain,
! [Q_172,R_173] : ~ ap_contractE_c3(combK,Q_172,R_173),
inference(resolution,[status(thm)],[c_234,c_61]) ).
tff(c_59,plain,
! [P_71,Q_72,R_73] :
( ( comb_app(P_71,ap_contractE_sk3q(P_71,Q_72,R_73)) = R_73 )
| ~ ap_contractE_c4(P_71,Q_72,R_73) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_215,plain,
! [Q_159,P_160,R_161] :
( member(pair(Q_159,ap_contractE_sk3q(P_160,Q_159,R_161)),contract)
| ~ ap_contractE_c4(P_160,Q_159,R_161) ),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_67,plain,
! [Q_76] :
( ~ member(pair(p,Q_76),contract)
| ( comb_app(combK,Q_76) != r ) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_263,plain,
! [P_187,R_188] :
( ( comb_app(combK,ap_contractE_sk3q(P_187,p,R_188)) != r )
| ~ ap_contractE_c4(P_187,p,R_188) ),
inference(resolution,[status(thm)],[c_215,c_67]) ).
tff(c_268,plain,
~ ap_contractE_c4(combK,p,r),
inference(superposition,[status(thm),theory(equality)],[c_59,c_263]) ).
tff(c_65,plain,
member(pair(comb_app(combK,p),r),contract),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_422,plain,
! [P_226,Q_227,R_228] :
( ap_contractE_c4(P_226,Q_227,R_228)
| ap_contractE_c3(P_226,Q_227,R_228)
| ap_contractE_c2(P_226,Q_227,R_228)
| ap_contractE_c1(P_226,Q_227,R_228)
| ~ member(pair(comb_app(P_226,Q_227),R_228),contract) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_448,plain,
( ap_contractE_c4(combK,p,r)
| ap_contractE_c3(combK,p,r)
| ap_contractE_c2(combK,p,r)
| ap_contractE_c1(combK,p,r) ),
inference(resolution,[status(thm)],[c_65,c_422]) ).
tff(c_454,plain,
ap_contractE_c1(combK,p,r),
inference(negUnitSimplification,[status(thm)],[c_316,c_249,c_268,c_448]) ).
tff(c_37,plain,
! [R_40,P_38,Q_39] :
( ( comb_app(combK,R_40) = P_38 )
| ~ ap_contractE_c1(P_38,Q_39,R_40) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_457,plain,
comb_app(combK,r) = combK,
inference(resolution,[status(thm)],[c_454,c_37]) ).
tff(c_467,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_457]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n008.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:11:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.94/1.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.94/1.93
% 3.94/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.94/1.95
% 3.94/1.95 Inference rules
% 3.94/1.95 ----------------------
% 3.94/1.95 #Ref : 7
% 3.94/1.95 #Sup : 94
% 3.94/1.95 #Fact : 0
% 3.94/1.95 #Define : 0
% 3.94/1.96 #Split : 0
% 3.94/1.96 #Chain : 0
% 3.94/1.96 #Close : 0
% 3.94/1.96
% 3.94/1.96 Ordering : KBO
% 3.94/1.96
% 3.94/1.96 Simplification rules
% 3.94/1.96 ----------------------
% 3.94/1.96 #Subsume : 7
% 3.94/1.96 #Demod : 0
% 3.94/1.96 #Tautology : 13
% 3.94/1.96 #SimpNegUnit : 2
% 3.94/1.96 #BackRed : 0
% 3.94/1.96
% 3.94/1.96 #Partial instantiations: 0
% 3.94/1.96 #Strategies tried : 1
% 3.94/1.96
% 3.94/1.96 Timing (in seconds)
% 3.94/1.96 ----------------------
% 3.94/1.96 Preprocessing : 0.53
% 3.94/1.96 Parsing : 0.28
% 3.94/1.96 CNF conversion : 0.03
% 3.94/1.96 Main loop : 0.38
% 3.94/1.96 Inferencing : 0.14
% 3.94/1.96 Reduction : 0.10
% 3.94/1.96 Demodulation : 0.06
% 3.94/1.96 BG Simplification : 0.02
% 3.94/1.96 Subsumption : 0.09
% 3.94/1.96 Abstraction : 0.02
% 3.94/1.96 MUC search : 0.00
% 3.94/1.96 Cooper : 0.00
% 3.94/1.96 Total : 0.95
% 3.94/1.96 Index Insertion : 0.00
% 3.94/1.96 Index Deletion : 0.00
% 3.94/1.96 Index Matching : 0.00
% 3.94/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------