TSTP Solution File: SYN028-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN028-1 : TPTP v8.1.2. Released v1.0.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 11:08:32 EDT 2023
% Result : Unsatisfiable 1.95s 1.39s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 24 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > t > s > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(t,type,
t: $o ).
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(s,type,
s: $o ).
tff(r,type,
r: $o ).
tff(f_47,axiom,
~ p,
file(unknown,unknown) ).
tff(f_26,axiom,
( q
| p ),
file(unknown,unknown) ).
tff(f_30,axiom,
( ~ q
| r ),
file(unknown,unknown) ).
tff(f_45,axiom,
( ~ t
| p ),
file(unknown,unknown) ).
tff(f_41,axiom,
( ~ s
| ~ r
| t ),
file(unknown,unknown) ).
tff(f_34,axiom,
( ~ r
| s ),
file(unknown,unknown) ).
tff(c_12,plain,
~ p,
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2,plain,
( p
| q ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_15,plain,
q,
inference(negUnitSimplification,[status(thm)],[c_12,c_2]) ).
tff(c_4,plain,
( r
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_17,plain,
r,
inference(demodulation,[status(thm),theory(equality)],[c_15,c_4]) ).
tff(c_10,plain,
( p
| ~ t ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_13,plain,
~ t,
inference(negUnitSimplification,[status(thm)],[c_12,c_10]) ).
tff(c_8,plain,
( t
| ~ r
| ~ s ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_14,plain,
( ~ r
| ~ s ),
inference(negUnitSimplification,[status(thm)],[c_13,c_8]) ).
tff(c_19,plain,
~ s,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_14]) ).
tff(c_6,plain,
( s
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_21,plain,
s,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_6]) ).
tff(c_22,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN028-1 : TPTP v8.1.2. Released v1.0.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.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 17:31:18 EDT 2023
% 0.12/0.34 % CPUTime :
% 1.95/1.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/1.40
% 1.95/1.40 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.95/1.43
% 1.95/1.43 Inference rules
% 1.95/1.43 ----------------------
% 1.95/1.43 #Ref : 0
% 1.95/1.43 #Sup : 0
% 1.95/1.43 #Fact : 0
% 1.95/1.43 #Define : 0
% 1.95/1.43 #Split : 0
% 1.95/1.43 #Chain : 0
% 1.95/1.43 #Close : 0
% 1.95/1.43
% 1.95/1.43 Ordering : KBO
% 1.95/1.43
% 1.95/1.43 Simplification rules
% 1.95/1.43 ----------------------
% 1.95/1.43 #Subsume : 5
% 1.95/1.43 #Demod : 3
% 1.95/1.43 #Tautology : 0
% 1.95/1.43 #SimpNegUnit : 4
% 1.95/1.43 #BackRed : 0
% 1.95/1.43
% 1.95/1.43 #Partial instantiations: 0
% 1.95/1.43 #Strategies tried : 1
% 1.95/1.43
% 1.95/1.43 Timing (in seconds)
% 1.95/1.43 ----------------------
% 1.95/1.43 Preprocessing : 0.32
% 1.95/1.43 Parsing : 0.17
% 1.95/1.43 CNF conversion : 0.01
% 1.95/1.44 Main loop : 0.07
% 1.95/1.44 Inferencing : 0.00
% 1.95/1.44 Reduction : 0.03
% 1.95/1.44 Demodulation : 0.02
% 1.95/1.44 BG Simplification : 0.01
% 1.95/1.44 Subsumption : 0.03
% 1.95/1.44 Abstraction : 0.00
% 1.95/1.44 MUC search : 0.00
% 1.95/1.44 Cooper : 0.00
% 1.95/1.44 Total : 0.44
% 1.95/1.44 Index Insertion : 0.00
% 1.95/1.44 Index Deletion : 0.00
% 1.95/1.44 Index Matching : 0.00
% 1.95/1.44 BG Taut test : 0.00
%------------------------------------------------------------------------------