TSTP Solution File: SYN101-1.002.002 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN101-1.002.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n005.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:37 EDT 2023
% Result : Unsatisfiable 2.93s 1.74s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 27 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 23 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q_2_2 > q_1_2 > q_1_1 > p_2_2 > p_1_2 > p_1_1 > nq_2 > nq_1 > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_1_1,type,
p_1_1: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(p_1_2,type,
p_1_2: ( $i * $i ) > $o ).
tff(nq_2,type,
nq_2: $i > $o ).
tff(p_2_2,type,
p_2_2: ( $i * $i ) > $o ).
tff(q_1_2,type,
q_1_2: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(q_1_1,type,
q_1_1: ( $i * $i ) > $o ).
tff(q_2_2,type,
q_2_2: ( $i * $i ) > $o ).
tff(nq_1,type,
nq_1: $i > $o ).
tff(f_111,axiom,
nq_1(a),
file(unknown,unknown) ).
tff(f_113,axiom,
nq_2(a),
file(unknown,unknown) ).
tff(f_86,axiom,
! [X_1,X_2] :
( p_1_1(X_1,X_2)
| ~ nq_1(X_1)
| ~ nq_2(X_2) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X_1,X_2] :
( p_2_2(X_1,X_2)
| ~ nq_1(X_1)
| ~ nq_2(X_2) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X_1,X_2] :
( p_1_2(X_1,X_2)
| ~ p_2_2(X_1,X_2)
| ~ p_1_1(X_1,X_2) ),
file(unknown,unknown) ).
tff(f_26,axiom,
~ p_1_2(a,a),
file(unknown,unknown) ).
tff(c_28,plain,
nq_1(a),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_32,plain,
nq_2(a),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_20,plain,
! [X_2_18,X_1_17] :
( ~ nq_2(X_2_18)
| ~ nq_1(X_1_17)
| p_1_1(X_1_17,X_2_18) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_24,plain,
! [X_2_22,X_1_21] :
( ~ nq_2(X_2_22)
| ~ nq_1(X_1_21)
| p_2_2(X_1_21,X_2_22) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_52,plain,
! [X_1_43,X_2_44] :
( ~ p_1_1(X_1_43,X_2_44)
| ~ p_2_2(X_1_43,X_2_44)
| p_1_2(X_1_43,X_2_44) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_85,plain,
! [X_1_53,X_2_54] :
( ~ p_1_1(X_1_53,X_2_54)
| p_1_2(X_1_53,X_2_54)
| ~ nq_2(X_2_54)
| ~ nq_1(X_1_53) ),
inference(resolution,[status(thm)],[c_24,c_52]) ).
tff(c_2,plain,
~ p_1_2(a,a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_91,plain,
( ~ p_1_1(a,a)
| ~ nq_2(a)
| ~ nq_1(a) ),
inference(resolution,[status(thm)],[c_85,c_2]) ).
tff(c_95,plain,
~ p_1_1(a,a),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_32,c_91]) ).
tff(c_98,plain,
( ~ nq_2(a)
| ~ nq_1(a) ),
inference(resolution,[status(thm)],[c_20,c_95]) ).
tff(c_102,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_32,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN101-1.002.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % 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.14/0.35 % Computer : n005.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:27:11 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.93/1.74 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.74
% 2.93/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.93/1.77
% 2.93/1.77 Inference rules
% 2.93/1.77 ----------------------
% 2.93/1.77 #Ref : 0
% 2.93/1.77 #Sup : 12
% 2.93/1.77 #Fact : 0
% 2.93/1.77 #Define : 0
% 2.93/1.77 #Split : 0
% 2.93/1.77 #Chain : 0
% 2.93/1.77 #Close : 0
% 2.93/1.77
% 2.93/1.77 Ordering : KBO
% 2.93/1.77
% 2.93/1.77 Simplification rules
% 2.93/1.77 ----------------------
% 2.93/1.77 #Subsume : 1
% 2.93/1.77 #Demod : 4
% 2.93/1.77 #Tautology : 3
% 2.93/1.77 #SimpNegUnit : 0
% 2.93/1.77 #BackRed : 0
% 2.93/1.77
% 2.93/1.77 #Partial instantiations: 0
% 2.93/1.77 #Strategies tried : 1
% 2.93/1.77
% 2.93/1.77 Timing (in seconds)
% 2.93/1.77 ----------------------
% 2.93/1.77 Preprocessing : 0.44
% 2.93/1.77 Parsing : 0.24
% 2.93/1.77 CNF conversion : 0.02
% 2.93/1.77 Main loop : 0.25
% 2.93/1.77 Inferencing : 0.11
% 2.93/1.77 Reduction : 0.06
% 2.93/1.77 Demodulation : 0.04
% 2.93/1.77 BG Simplification : 0.02
% 2.93/1.77 Subsumption : 0.05
% 2.93/1.77 Abstraction : 0.01
% 2.93/1.77 MUC search : 0.00
% 2.93/1.77 Cooper : 0.00
% 2.93/1.77 Total : 0.74
% 2.93/1.77 Index Insertion : 0.00
% 2.93/1.77 Index Deletion : 0.00
% 2.93/1.77 Index Matching : 0.00
% 2.93/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------