TSTP Solution File: SYN044+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN044+1 : TPTP v8.1.2. Released v2.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 : 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:05 EDT 2023
% Result : Theorem 2.36s 1.54s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 9 ~; 9 |; 1 &)
% ( 1 <=>; 3 =>; 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_43,negated_conjecture,
~ ( p
<=> q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10) ).
tff(f_29,axiom,
( q
=> r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_1) ).
tff(f_34,axiom,
( r
=> ( p
& q ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_2) ).
tff(f_39,axiom,
( p
=> ( q
| r ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_3) ).
tff(c_16,plain,
( p
| q ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_17,plain,
q,
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_2,plain,
( r
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_19,plain,
r,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_2]) ).
tff(c_6,plain,
( p
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_23,plain,
p,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_6]) ).
tff(c_10,plain,
( ~ q
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_25,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_17,c_10]) ).
tff(c_27,plain,
~ q,
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_4,plain,
( q
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_30,plain,
~ r,
inference(negUnitSimplification,[status(thm)],[c_27,c_4]) ).
tff(c_26,plain,
p,
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_8,plain,
( r
| q
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_33,plain,
( r
| q ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_8]) ).
tff(c_34,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_27,c_30,c_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN044+1 : TPTP v8.1.2. Released v2.0.0.
% 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.15/0.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:20:26 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.36/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.36/1.54
% 2.36/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.49/1.58
% 2.49/1.58 Inference rules
% 2.49/1.58 ----------------------
% 2.49/1.58 #Ref : 0
% 2.49/1.58 #Sup : 0
% 2.49/1.58 #Fact : 0
% 2.49/1.58 #Define : 0
% 2.49/1.58 #Split : 1
% 2.49/1.58 #Chain : 0
% 2.49/1.58 #Close : 0
% 2.49/1.58
% 2.49/1.58 Ordering : KBO
% 2.49/1.58
% 2.49/1.58 Simplification rules
% 2.49/1.58 ----------------------
% 2.49/1.58 #Subsume : 3
% 2.49/1.58 #Demod : 9
% 2.49/1.58 #Tautology : 3
% 2.49/1.58 #SimpNegUnit : 2
% 2.49/1.58 #BackRed : 0
% 2.49/1.58
% 2.49/1.58 #Partial instantiations: 0
% 2.49/1.58 #Strategies tried : 1
% 2.49/1.58
% 2.49/1.58 Timing (in seconds)
% 2.49/1.58 ----------------------
% 2.49/1.58 Preprocessing : 0.37
% 2.49/1.58 Parsing : 0.20
% 2.49/1.58 CNF conversion : 0.02
% 2.49/1.58 Main loop : 0.12
% 2.49/1.58 Inferencing : 0.04
% 2.49/1.58 Reduction : 0.03
% 2.49/1.58 Demodulation : 0.02
% 2.49/1.58 BG Simplification : 0.01
% 2.53/1.58 Subsumption : 0.03
% 2.53/1.58 Abstraction : 0.00
% 2.53/1.58 MUC search : 0.00
% 2.53/1.58 Cooper : 0.00
% 2.53/1.58 Total : 0.55
% 2.53/1.58 Index Insertion : 0.00
% 2.53/1.58 Index Deletion : 0.00
% 2.53/1.58 Index Matching : 0.00
% 2.53/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------