TSTP Solution File: SYN029-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN029-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/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:08:32 EDT 2023
% Result : Unsatisfiable 1.94s 1.44s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 10 unt; 3 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(r,type,
r: $o ).
tff(f_26,axiom,
( q
| p ),
file(unknown,unknown) ).
tff(f_43,axiom,
( ~ p
| ~ q ),
file(unknown,unknown) ).
tff(f_38,axiom,
r,
file(unknown,unknown) ).
tff(f_37,axiom,
( ~ r
| ~ q
| p ),
file(unknown,unknown) ).
tff(f_30,axiom,
( ~ p
| q ),
file(unknown,unknown) ).
tff(c_2,plain,
( p
| q ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_13,plain,
q,
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_10,plain,
( ~ q
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_15,plain,
~ p,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_10]) ).
tff(c_8,plain,
r,
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_6,plain,
( p
| ~ q
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_12,plain,
( p
| ~ q ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_17,plain,
p,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_12]) ).
tff(c_18,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_17]) ).
tff(c_20,plain,
~ q,
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_19,plain,
p,
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_4,plain,
( q
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_25,plain,
q,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_4]) ).
tff(c_26,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN029-1 : TPTP v8.1.2. Released v1.0.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.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:30:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.94/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.94/1.44
% 1.94/1.44 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.94/1.48
% 1.94/1.48 Inference rules
% 1.94/1.48 ----------------------
% 1.94/1.48 #Ref : 0
% 1.94/1.48 #Sup : 0
% 1.94/1.48 #Fact : 0
% 1.94/1.48 #Define : 0
% 1.94/1.48 #Split : 1
% 1.94/1.48 #Chain : 0
% 1.94/1.48 #Close : 0
% 1.94/1.48
% 1.94/1.48 Ordering : KBO
% 1.94/1.48
% 1.94/1.48 Simplification rules
% 1.94/1.48 ----------------------
% 1.94/1.48 #Subsume : 2
% 1.94/1.48 #Demod : 6
% 1.94/1.48 #Tautology : 0
% 1.94/1.48 #SimpNegUnit : 2
% 1.94/1.48 #BackRed : 0
% 1.94/1.48
% 1.94/1.48 #Partial instantiations: 0
% 1.94/1.48 #Strategies tried : 1
% 1.94/1.48
% 1.94/1.48 Timing (in seconds)
% 1.94/1.48 ----------------------
% 1.94/1.48 Preprocessing : 0.31
% 1.94/1.48 Parsing : 0.17
% 1.94/1.48 CNF conversion : 0.01
% 1.94/1.48 Main loop : 0.11
% 1.94/1.48 Inferencing : 0.03
% 1.94/1.48 Reduction : 0.03
% 1.94/1.48 Demodulation : 0.02
% 1.94/1.48 BG Simplification : 0.01
% 1.94/1.48 Subsumption : 0.03
% 1.94/1.48 Abstraction : 0.00
% 1.94/1.48 MUC search : 0.00
% 1.94/1.48 Cooper : 0.00
% 1.94/1.48 Total : 0.48
% 1.94/1.48 Index Insertion : 0.00
% 1.94/1.48 Index Deletion : 0.00
% 1.94/1.48 Index Matching : 0.00
% 1.94/1.48 BG Taut test : 0.00
%------------------------------------------------------------------------------