TSTP Solution File: SYN083-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN083-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n001.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:09:34 EDT 2023
% Result : Unsatisfiable 2.01s 1.56s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of formulae : 10 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(d,type,
d: $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_23,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_25,axiom,
f(a,f(b,f(c,d))) != f(f(f(a,b),c),d),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( f(f(X_1,Y_2),Z_3) = f(X_1,f(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_4,plain,
f(f(f(a,b),c),d) != f(a,f(b,f(c,d))),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_6,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN083-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:41:55 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.01/1.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.01/1.57
% 2.01/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.01/1.61
% 2.01/1.61 Inference rules
% 2.01/1.61 ----------------------
% 2.01/1.61 #Ref : 0
% 2.01/1.61 #Sup : 0
% 2.01/1.61 #Fact : 0
% 2.01/1.61 #Define : 0
% 2.01/1.61 #Split : 0
% 2.01/1.61 #Chain : 0
% 2.01/1.61 #Close : 0
% 2.01/1.61
% 2.01/1.61 Ordering : KBO
% 2.01/1.61
% 2.01/1.61 Simplification rules
% 2.01/1.61 ----------------------
% 2.01/1.61 #Subsume : 1
% 2.01/1.61 #Demod : 3
% 2.01/1.61 #Tautology : 0
% 2.01/1.61 #SimpNegUnit : 0
% 2.01/1.61 #BackRed : 0
% 2.01/1.61
% 2.01/1.61 #Partial instantiations: 0
% 2.01/1.61 #Strategies tried : 1
% 2.01/1.61
% 2.01/1.61 Timing (in seconds)
% 2.01/1.61 ----------------------
% 2.01/1.61 Preprocessing : 0.40
% 2.01/1.61 Parsing : 0.21
% 2.01/1.61 CNF conversion : 0.02
% 2.01/1.61 Main loop : 0.05
% 2.01/1.61 Inferencing : 0.00
% 2.01/1.61 Reduction : 0.02
% 2.01/1.61 Demodulation : 0.02
% 2.01/1.61 BG Simplification : 0.01
% 2.01/1.61 Subsumption : 0.02
% 2.01/1.61 Abstraction : 0.00
% 2.01/1.61 MUC search : 0.00
% 2.01/1.61 Cooper : 0.00
% 2.01/1.61 Total : 0.50
% 2.01/1.61 Index Insertion : 0.00
% 2.01/1.61 Index Deletion : 0.00
% 2.01/1.61 Index Matching : 0.00
% 2.01/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------