TSTP Solution File: SYN093-1.002 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN093-1.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 : n018.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.03s 2.07s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 27
% Syntax : Number of formulae : 46 ( 11 unt; 19 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 23 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 20 ( 19 usr; 20 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > u_9 > u_8 > u_7 > u_6 > u_5 > u_4 > u_3 > u_2 > u_13 > u_12 > u_11 > u_10 > u_1 > q_2_2 > q_1_2 > q_1_1 > p_2_2 > p_1_2 > p_1_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(u_6,type,
u_6: $o ).
tff(u_1,type,
u_1: $o ).
tff(p_2_2,type,
p_2_2: $o ).
tff(u_5,type,
u_5: $o ).
tff(u_3,type,
u_3: $o ).
tff(u_8,type,
u_8: $o ).
tff(u_12,type,
u_12: $o ).
tff(q_1_1,type,
q_1_1: $o ).
tff(u_13,type,
u_13: $o ).
tff(u_4,type,
u_4: $o ).
tff(p_1_1,type,
p_1_1: $o ).
tff(p_1_2,type,
p_1_2: $o ).
tff(u_2,type,
u_2: $o ).
tff(u_11,type,
u_11: $o ).
tff(u_7,type,
u_7: $o ).
tff(q_1_2,type,
q_1_2: $o ).
tff(u_9,type,
u_9: $o ).
tff(q_2_2,type,
q_2_2: $o ).
tff(u_10,type,
u_10: $o ).
tff(f_30,axiom,
~ u_1,
file(unknown,unknown) ).
tff(f_28,axiom,
( u_1
| ~ p_1_2 ),
file(unknown,unknown) ).
tff(f_43,axiom,
( p_1_2
| ~ u_2 ),
file(unknown,unknown) ).
tff(f_39,axiom,
( u_2
| p_1_2
| ~ p_2_2
| ~ p_1_1 ),
file(unknown,unknown) ).
tff(f_143,axiom,
( p_2_2
| ~ u_12 ),
file(unknown,unknown) ).
tff(f_139,axiom,
( u_12
| p_2_2 ),
file(unknown,unknown) ).
tff(f_125,axiom,
( u_10
| p_1_1 ),
file(unknown,unknown) ).
tff(f_129,axiom,
( p_1_1
| ~ u_10 ),
file(unknown,unknown) ).
tff(c_4,plain,
~ u_1,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
( ~ p_1_2
| u_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_53,plain,
~ p_1_2,
inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).
tff(c_8,plain,
( ~ u_2
| p_1_2 ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_56,plain,
~ u_2,
inference(negUnitSimplification,[status(thm)],[c_53,c_8]) ).
tff(c_6,plain,
( ~ p_1_1
| ~ p_2_2
| p_1_2
| u_2 ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_57,plain,
( ~ p_1_1
| ~ p_2_2
| u_2 ),
inference(negUnitSimplification,[status(thm)],[c_53,c_6]) ).
tff(c_59,plain,
( ~ p_1_1
| ~ p_2_2 ),
inference(negUnitSimplification,[status(thm)],[c_56,c_57]) ).
tff(c_64,plain,
~ p_2_2,
inference(splitLeft,[status(thm)],[c_59]) ).
tff(c_48,plain,
( ~ u_12
| p_2_2 ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_72,plain,
~ u_12,
inference(negUnitSimplification,[status(thm)],[c_64,c_48]) ).
tff(c_46,plain,
( p_2_2
| u_12 ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_73,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_72,c_64,c_46]) ).
tff(c_74,plain,
~ p_1_1,
inference(splitRight,[status(thm)],[c_59]) ).
tff(c_38,plain,
( p_1_1
| u_10 ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_78,plain,
u_10,
inference(negUnitSimplification,[status(thm)],[c_74,c_38]) ).
tff(c_40,plain,
( ~ u_10
| p_1_1 ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_82,plain,
p_1_1,
inference(demodulation,[status(thm),theory(equality)],[c_78,c_40]) ).
tff(c_83,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_74,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN093-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.15 % 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.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:18:20 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.03/2.07 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/2.07
% 3.03/2.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.03/2.11
% 3.03/2.11 Inference rules
% 3.03/2.11 ----------------------
% 3.03/2.11 #Ref : 0
% 3.03/2.11 #Sup : 0
% 3.03/2.11 #Fact : 0
% 3.03/2.11 #Define : 0
% 3.03/2.11 #Split : 7
% 3.03/2.11 #Chain : 0
% 3.03/2.11 #Close : 0
% 3.03/2.11
% 3.03/2.11 Ordering : KBO
% 3.03/2.11
% 3.03/2.11 Simplification rules
% 3.03/2.11 ----------------------
% 3.03/2.11 #Subsume : 2
% 3.03/2.11 #Demod : 5
% 3.03/2.11 #Tautology : 1
% 3.03/2.11 #SimpNegUnit : 13
% 3.03/2.11 #BackRed : 0
% 3.03/2.11
% 3.03/2.11 #Partial instantiations: 0
% 3.03/2.11 #Strategies tried : 1
% 3.03/2.11
% 3.03/2.11 Timing (in seconds)
% 3.03/2.11 ----------------------
% 3.03/2.11 Preprocessing : 0.58
% 3.03/2.11 Parsing : 0.30
% 3.03/2.11 CNF conversion : 0.03
% 3.03/2.11 Main loop : 0.23
% 3.03/2.11 Inferencing : 0.04
% 3.03/2.11 Reduction : 0.07
% 3.03/2.11 Demodulation : 0.04
% 3.03/2.11 BG Simplification : 0.03
% 3.03/2.11 Subsumption : 0.06
% 3.03/2.11 Abstraction : 0.01
% 3.03/2.11 MUC search : 0.00
% 3.03/2.11 Cooper : 0.00
% 3.03/2.11 Total : 0.87
% 3.03/2.11 Index Insertion : 0.00
% 3.03/2.11 Index Deletion : 0.00
% 3.03/2.11 Index Matching : 0.00
% 3.03/2.11 BG Taut test : 0.00
%------------------------------------------------------------------------------