TSTP Solution File: SYN343-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN343-1 : TPTP v8.1.2. Released v1.2.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 : n004.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:10:32 EDT 2023
% Result : Unsatisfiable 2.20s 1.49s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > z > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(z,type,
z: ( $i * $i ) > $i ).
tff(f_41,axiom,
! [Y1,Y2] :
( ~ f(a,a)
| ~ f(Y1,Y2) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [Y1] :
( f(a,Y1)
| f(a,a) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [Y1_4,Y2_5] :
( ~ f(Y1_4,Y2_5)
| ~ f(a,a) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_7,plain,
~ f(a,a),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_2,plain,
! [Y1_1] :
( f(a,a)
| f(a,Y1_1) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
! [Y1_1] : f(a,Y1_1),
inference(negUnitSimplification,[status(thm)],[c_7,c_2]) ).
tff(c_11,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_7]) ).
tff(c_12,plain,
! [Y1_4,Y2_5] : ~ f(Y1_4,Y2_5),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_13,plain,
f(a,a),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_15,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN343-1 : TPTP v8.1.2. Released v1.2.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 : n004.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 : Thu Aug 3 17:18:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.20/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/1.50
% 2.20/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.41/1.53
% 2.41/1.53 Inference rules
% 2.41/1.53 ----------------------
% 2.41/1.53 #Ref : 0
% 2.41/1.53 #Sup : 0
% 2.41/1.53 #Fact : 0
% 2.41/1.53 #Define : 0
% 2.41/1.53 #Split : 1
% 2.41/1.53 #Chain : 0
% 2.41/1.53 #Close : 0
% 2.41/1.53
% 2.41/1.53 Ordering : KBO
% 2.41/1.53
% 2.41/1.53 Simplification rules
% 2.41/1.53 ----------------------
% 2.41/1.53 #Subsume : 0
% 2.41/1.53 #Demod : 1
% 2.41/1.53 #Tautology : 0
% 2.41/1.53 #SimpNegUnit : 2
% 2.41/1.53 #BackRed : 1
% 2.41/1.53
% 2.41/1.53 #Partial instantiations: 0
% 2.41/1.53 #Strategies tried : 1
% 2.41/1.53
% 2.41/1.53 Timing (in seconds)
% 2.41/1.53 ----------------------
% 2.41/1.54 Preprocessing : 0.39
% 2.41/1.54 Parsing : 0.22
% 2.41/1.54 CNF conversion : 0.02
% 2.41/1.54 Main loop : 0.09
% 2.41/1.54 Inferencing : 0.01
% 2.41/1.54 Reduction : 0.02
% 2.41/1.54 Demodulation : 0.01
% 2.41/1.54 BG Simplification : 0.01
% 2.41/1.54 Subsumption : 0.03
% 2.41/1.54 Abstraction : 0.00
% 2.41/1.54 MUC search : 0.00
% 2.41/1.54 Cooper : 0.00
% 2.41/1.54 Total : 0.54
% 2.41/1.54 Index Insertion : 0.00
% 2.41/1.54 Index Deletion : 0.00
% 2.41/1.54 Index Matching : 0.00
% 2.41/1.54 BG Taut test : 0.00
%------------------------------------------------------------------------------