TSTP Solution File: SYN099-1.003 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN099-1.003 : 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/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 : 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:09:36 EDT 2023
% Result : Unsatisfiable 3.46s 1.90s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 48 ( 14 unt; 25 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 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 : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of predicates : 25 ( 24 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sym_q_3_3 > sym_q_2_3 > sym_q_2_2 > sym_q_1_3 > sym_q_1_2 > sym_q_1_1 > sym_p_3_3 > sym_p_2_3 > sym_p_2_2 > sym_p_1_3 > sym_p_1_2 > sym_p_1_1 > q_3_3 > q_2_3 > q_2_2 > q_1_3 > q_1_2 > q_1_1 > p_3_3 > p_2_3 > p_2_2 > p_1_3 > p_1_2 > p_1_1 > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_2_2,type,
p_2_2: $i > $o ).
tff(sym_q_1_2,type,
sym_q_1_2: $i > $o ).
tff(p_1_3,type,
p_1_3: $i > $o ).
tff(sym_q_2_2,type,
sym_q_2_2: $i > $o ).
tff(sym_p_2_3,type,
sym_p_2_3: $i > $o ).
tff(a,type,
a: $i ).
tff(p_3_3,type,
p_3_3: $i > $o ).
tff(sym_p_1_1,type,
sym_p_1_1: $i > $o ).
tff(sym_q_1_1,type,
sym_q_1_1: $i > $o ).
tff(sym_q_3_3,type,
sym_q_3_3: $i > $o ).
tff(sym_q_1_3,type,
sym_q_1_3: $i > $o ).
tff(sym_p_1_3,type,
sym_p_1_3: $i > $o ).
tff(p_1_2,type,
p_1_2: $i > $o ).
tff(p_1_1,type,
p_1_1: $i > $o ).
tff(p_2_3,type,
p_2_3: $i > $o ).
tff(q_2_2,type,
q_2_2: $i > $o ).
tff(sym_p_2_2,type,
sym_p_2_2: $i > $o ).
tff(q_1_3,type,
q_1_3: $i > $o ).
tff(q_2_3,type,
q_2_3: $i > $o ).
tff(q_1_2,type,
q_1_2: $i > $o ).
tff(sym_p_1_2,type,
sym_p_1_2: $i > $o ).
tff(sym_q_2_3,type,
sym_q_2_3: $i > $o ).
tff(sym_p_3_3,type,
sym_p_3_3: $i > $o ).
tff(q_3_3,type,
q_3_3: $i > $o ).
tff(q_1_1,type,
q_1_1: $i > $o ).
tff(f_154,axiom,
p_1_1(a),
file(unknown,unknown) ).
tff(f_156,axiom,
p_2_2(a),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X] :
( p_1_2(X)
| ~ p_2_2(X)
| ~ p_1_1(X) ),
file(unknown,unknown) ).
tff(f_157,axiom,
q_2_2(a),
file(unknown,unknown) ).
tff(f_159,axiom,
q_3_3(a),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X] :
( p_2_3(X)
| ~ q_3_3(X)
| ~ q_2_2(X) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X] : ~ p_1_3(X),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] :
( p_1_3(X)
| ~ p_2_3(X)
| ~ p_1_2(X) ),
file(unknown,unknown) ).
tff(c_40,plain,
p_1_1(a),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_44,plain,
p_2_2(a),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_156,plain,
! [X_60] :
( ~ p_1_1(X_60)
| ~ p_2_2(X_60)
| p_1_2(X_60) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_162,plain,
( ~ p_1_1(a)
| p_1_2(a) ),
inference(resolution,[status(thm)],[c_44,c_156]) ).
tff(c_166,plain,
p_1_2(a),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_162]) ).
tff(c_46,plain,
q_2_2(a),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_50,plain,
q_3_3(a),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_145,plain,
! [X_59] :
( ~ q_2_2(X_59)
| ~ q_3_3(X_59)
| p_2_3(X_59) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_151,plain,
( ~ q_2_2(a)
| p_2_3(a) ),
inference(resolution,[status(thm)],[c_50,c_145]) ).
tff(c_155,plain,
p_2_3(a),
inference(demodulation,[status(thm),theory(equality)],[c_46,c_151]) ).
tff(c_2,plain,
! [X_1] : ~ p_1_3(X_1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
! [X_4] :
( ~ p_1_2(X_4)
| ~ p_2_3(X_4)
| p_1_3(X_4) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_106,plain,
! [X_4] :
( ~ p_1_2(X_4)
| ~ p_2_3(X_4) ),
inference(negUnitSimplification,[status(thm)],[c_2,c_8]) ).
tff(c_170,plain,
~ p_1_2(a),
inference(resolution,[status(thm)],[c_155,c_106]) ).
tff(c_177,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_166,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN099-1.003 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 17:23:18 EDT 2023
% 0.17/0.36 % CPUTime :
% 3.46/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.46/1.91
% 3.46/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.62/1.94
% 3.62/1.94 Inference rules
% 3.62/1.94 ----------------------
% 3.62/1.94 #Ref : 0
% 3.62/1.94 #Sup : 10
% 3.62/1.94 #Fact : 0
% 3.62/1.94 #Define : 0
% 3.62/1.94 #Split : 0
% 3.62/1.94 #Chain : 0
% 3.62/1.94 #Close : 0
% 3.62/1.94
% 3.62/1.94 Ordering : KBO
% 3.62/1.94
% 3.62/1.94 Simplification rules
% 3.62/1.94 ----------------------
% 3.62/1.94 #Subsume : 0
% 3.62/1.94 #Demod : 6
% 3.62/1.94 #Tautology : 4
% 3.62/1.94 #SimpNegUnit : 3
% 3.62/1.94 #BackRed : 0
% 3.62/1.94
% 3.62/1.94 #Partial instantiations: 0
% 3.62/1.94 #Strategies tried : 1
% 3.62/1.94
% 3.62/1.94 Timing (in seconds)
% 3.62/1.94 ----------------------
% 3.62/1.94 Preprocessing : 0.53
% 3.62/1.94 Parsing : 0.29
% 3.62/1.94 CNF conversion : 0.03
% 3.62/1.94 Main loop : 0.28
% 3.62/1.94 Inferencing : 0.11
% 3.62/1.94 Reduction : 0.08
% 3.62/1.94 Demodulation : 0.05
% 3.62/1.94 BG Simplification : 0.03
% 3.62/1.94 Subsumption : 0.05
% 3.62/1.94 Abstraction : 0.01
% 3.62/1.94 MUC search : 0.00
% 3.62/1.94 Cooper : 0.00
% 3.62/1.94 Total : 0.86
% 3.62/1.94 Index Insertion : 0.00
% 3.62/1.94 Index Deletion : 0.00
% 3.62/1.94 Index Matching : 0.00
% 3.62/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------