TSTP Solution File: SYN954+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN954+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 : n006.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:16:58 EDT 2023
% Result : Theorem 2.43s 1.54s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 3 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 (; 6 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $i > $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_39,negated_conjecture,
~ ! [A,B] :
( ! [Z] :
( q(Z)
=> p(Z) )
=> ? [X] :
( ( p(X)
=> p(A) )
& ( q(X)
=> p(B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_10,plain,
! [X_4] :
( p(X_4)
| q(X_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
! [Z_6] :
( p(Z_6)
| ~ q(Z_6) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_16,plain,
! [X_4] : p(X_4),
inference(resolution,[status(thm)],[c_10,c_12]) ).
tff(c_4,plain,
( ~ p('#skF_1')
| ~ p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_26,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN954+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13 % 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.13/0.35 % Computer : n006.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:10:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.43/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.54
% 2.43/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.43/1.56
% 2.43/1.56 Inference rules
% 2.43/1.56 ----------------------
% 2.43/1.56 #Ref : 0
% 2.43/1.56 #Sup : 1
% 2.43/1.56 #Fact : 0
% 2.43/1.56 #Define : 0
% 2.43/1.56 #Split : 0
% 2.43/1.56 #Chain : 0
% 2.43/1.56 #Close : 0
% 2.43/1.56
% 2.43/1.56 Ordering : KBO
% 2.43/1.56
% 2.43/1.56 Simplification rules
% 2.43/1.56 ----------------------
% 2.43/1.56 #Subsume : 0
% 2.43/1.56 #Demod : 7
% 2.43/1.56 #Tautology : 3
% 2.43/1.56 #SimpNegUnit : 0
% 2.43/1.56 #BackRed : 0
% 2.43/1.56
% 2.43/1.56 #Partial instantiations: 0
% 2.43/1.56 #Strategies tried : 1
% 2.43/1.56
% 2.43/1.56 Timing (in seconds)
% 2.43/1.56 ----------------------
% 2.43/1.57 Preprocessing : 0.38
% 2.43/1.57 Parsing : 0.21
% 2.43/1.57 CNF conversion : 0.02
% 2.43/1.57 Main loop : 0.14
% 2.43/1.57 Inferencing : 0.07
% 2.66/1.57 Reduction : 0.02
% 2.66/1.57 Demodulation : 0.01
% 2.66/1.57 BG Simplification : 0.01
% 2.66/1.57 Subsumption : 0.03
% 2.66/1.57 Abstraction : 0.00
% 2.66/1.57 MUC search : 0.00
% 2.66/1.57 Cooper : 0.00
% 2.66/1.57 Total : 0.57
% 2.66/1.57 Index Insertion : 0.00
% 2.66/1.57 Index Deletion : 0.00
% 2.66/1.57 Index Matching : 0.00
% 2.66/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------