TSTP Solution File: MGT045+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT045+1 : TPTP v8.1.2. Released v2.4.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 : 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 10:49:42 EDT 2023
% Result : Theorem 3.62s 1.94s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 23 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 26 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 25 ( 11 ~; 6 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > greater_or_equal > greater > organization > position > external_ties > age > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(organization,type,
organization: $i > $o ).
tff(position,type,
position: ( $i * $i ) > $i ).
tff(smaller,type,
smaller: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(age,type,
age: ( $i * $i ) > $i ).
tff(external_ties,type,
external_ties: ( $i * $i ) > $i ).
tff(greater_or_equal,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(smaller_or_equal,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(f_150,negated_conjecture,
~ ! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> greater(position(X,T),position(X,T0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4) ).
tff(f_139,axiom,
! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> greater(external_ties(X,T),external_ties(X,T0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_8) ).
tff(f_131,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( greater(external_ties(X,T),external_ties(X,T0))
=> greater(position(X,T),position(X,T0)) )
& ( ( external_ties(X,T) = external_ties(X,T0) )
=> ( position(X,T) = position(X,T0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).
tff(c_34,plain,
organization('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_32,plain,
greater(age('#skF_1','#skF_3'),age('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_28,plain,
! [X_17,T_19,T0_18] :
( greater(external_ties(X_17,T_19),external_ties(X_17,T0_18))
| ~ greater(age(X_17,T_19),age(X_17,T0_18))
| ~ organization(X_17) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_524,plain,
! [X_70,T_71,T0_72] :
( greater(position(X_70,T_71),position(X_70,T0_72))
| ~ greater(external_ties(X_70,T_71),external_ties(X_70,T0_72))
| ~ organization(X_70) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_30,plain,
~ greater(position('#skF_1','#skF_3'),position('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_543,plain,
( ~ greater(external_ties('#skF_1','#skF_3'),external_ties('#skF_1','#skF_2'))
| ~ organization('#skF_1') ),
inference(resolution,[status(thm)],[c_524,c_30]) ).
tff(c_570,plain,
~ greater(external_ties('#skF_1','#skF_3'),external_ties('#skF_1','#skF_2')),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_543]) ).
tff(c_582,plain,
( ~ greater(age('#skF_1','#skF_3'),age('#skF_1','#skF_2'))
| ~ organization('#skF_1') ),
inference(resolution,[status(thm)],[c_28,c_570]) ).
tff(c_597,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32,c_582]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT045+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % 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.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:29:28 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.62/1.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.62/1.94
% 3.62/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.05/1.97
% 4.05/1.97 Inference rules
% 4.05/1.97 ----------------------
% 4.05/1.97 #Ref : 0
% 4.05/1.97 #Sup : 130
% 4.05/1.97 #Fact : 8
% 4.05/1.97 #Define : 0
% 4.05/1.97 #Split : 0
% 4.05/1.97 #Chain : 0
% 4.05/1.97 #Close : 0
% 4.05/1.97
% 4.05/1.97 Ordering : KBO
% 4.05/1.97
% 4.05/1.97 Simplification rules
% 4.05/1.97 ----------------------
% 4.05/1.97 #Subsume : 29
% 4.05/1.97 #Demod : 16
% 4.05/1.97 #Tautology : 12
% 4.05/1.97 #SimpNegUnit : 0
% 4.05/1.97 #BackRed : 0
% 4.05/1.97
% 4.05/1.97 #Partial instantiations: 0
% 4.05/1.97 #Strategies tried : 1
% 4.05/1.97
% 4.05/1.97 Timing (in seconds)
% 4.05/1.97 ----------------------
% 4.05/1.97 Preprocessing : 0.49
% 4.05/1.97 Parsing : 0.25
% 4.05/1.97 CNF conversion : 0.03
% 4.05/1.97 Main loop : 0.42
% 4.05/1.97 Inferencing : 0.17
% 4.05/1.97 Reduction : 0.10
% 4.05/1.97 Demodulation : 0.07
% 4.05/1.97 BG Simplification : 0.03
% 4.05/1.97 Subsumption : 0.11
% 4.05/1.98 Abstraction : 0.02
% 4.05/1.98 MUC search : 0.00
% 4.05/1.98 Cooper : 0.00
% 4.05/1.98 Total : 0.96
% 4.05/1.98 Index Insertion : 0.00
% 4.05/1.98 Index Deletion : 0.00
% 4.05/1.98 Index Matching : 0.00
% 4.05/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------