TSTP Solution File: SYN978+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN978+1 : TPTP v8.1.2. Released v3.1.0.
% 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 : n028.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:17:02 EDT 2023
% Result : Theorem 2.03s 1.41s
% Output : CNFRefutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 4 unt; 2 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 1 |; 1 &)
% ( 1 <=>; 1 =>; 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 : 3 ( 2 usr; 3 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(b,type,
b: $o ).
tff(a,type,
a: $o ).
tff(f_32,negated_conjecture,
~ ( ( a
& b )
=> ( a
<=> b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_4,plain,
a,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_6,plain,
( ~ b
| ~ a ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_15,plain,
~ b,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6]) ).
tff(c_2,plain,
b,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_16,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN978+1 : TPTP v8.1.2. Released v3.1.0.
% 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.19/0.36 % Computer : n028.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 17:37:24 EDT 2023
% 0.19/0.36 % CPUTime :
% 2.03/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.03/1.41
% 2.03/1.41 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.16/1.45
% 2.16/1.45 Inference rules
% 2.16/1.45 ----------------------
% 2.16/1.45 #Ref : 0
% 2.16/1.45 #Sup : 0
% 2.16/1.45 #Fact : 0
% 2.16/1.45 #Define : 0
% 2.16/1.45 #Split : 0
% 2.16/1.45 #Chain : 0
% 2.16/1.45 #Close : 0
% 2.16/1.45
% 2.16/1.45 Ordering : KBO
% 2.16/1.45
% 2.16/1.45 Simplification rules
% 2.16/1.45 ----------------------
% 2.16/1.45 #Subsume : 2
% 2.16/1.45 #Demod : 2
% 2.16/1.45 #Tautology : 3
% 2.16/1.45 #SimpNegUnit : 1
% 2.16/1.45 #BackRed : 0
% 2.16/1.45
% 2.16/1.45 #Partial instantiations: 0
% 2.16/1.45 #Strategies tried : 1
% 2.16/1.45
% 2.16/1.45 Timing (in seconds)
% 2.16/1.45 ----------------------
% 2.16/1.45 Preprocessing : 0.32
% 2.16/1.45 Parsing : 0.17
% 2.16/1.45 CNF conversion : 0.02
% 2.16/1.45 Main loop : 0.05
% 2.16/1.45 Inferencing : 0.00
% 2.16/1.45 Reduction : 0.02
% 2.16/1.45 Demodulation : 0.01
% 2.16/1.45 BG Simplification : 0.01
% 2.16/1.45 Subsumption : 0.02
% 2.16/1.45 Abstraction : 0.00
% 2.16/1.45 MUC search : 0.00
% 2.16/1.45 Cooper : 0.00
% 2.16/1.45 Total : 0.42
% 2.16/1.45 Index Insertion : 0.00
% 2.16/1.45 Index Deletion : 0.00
% 2.16/1.45 Index Matching : 0.00
% 2.16/1.45 BG Taut test : 0.00
%------------------------------------------------------------------------------