TSTP Solution File: MSC011+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MSC011+1 : TPTP v8.1.2. Released v3.2.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 : n008.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:49 EDT 2023
% Result : Theorem 1.98s 1.43s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 18 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 (; 6 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ not_drunk > drunk > #nlpp > neg_psi > goal > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(neg_psi,type,
neg_psi: $o ).
tff(goal,type,
goal: $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(drunk,type,
drunk: $i > $o ).
tff(not_drunk,type,
not_drunk: $i > $o ).
tff(f_40,negated_conjecture,
~ goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
tff(f_34,axiom,
! [A] :
( drunk(A)
& neg_psi ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_phi) ).
tff(f_30,axiom,
! [A] :
( ( drunk(A)
& not_drunk(A) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_cons) ).
tff(f_38,axiom,
( neg_psi
=> ? [A] : not_drunk(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_psi_ax) ).
tff(c_10,plain,
~ goal,
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [A_2] : drunk(A_2),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [A_1] :
( goal
| ~ not_drunk(A_1)
| ~ drunk(A_1) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_14,plain,
! [A_1] :
( goal
| ~ not_drunk(A_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_15,plain,
! [A_1] : ~ not_drunk(A_1),
inference(negUnitSimplification,[status(thm)],[c_10,c_14]) ).
tff(c_6,plain,
neg_psi,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_8,plain,
( not_drunk('#skF_1')
| ~ neg_psi ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
not_drunk('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8]) ).
tff(c_16,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC011+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:11:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 1.98/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.98/1.43
% 1.98/1.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.98/1.47
% 1.98/1.47 Inference rules
% 1.98/1.47 ----------------------
% 1.98/1.47 #Ref : 0
% 1.98/1.47 #Sup : 0
% 1.98/1.47 #Fact : 0
% 1.98/1.47 #Define : 0
% 1.98/1.47 #Split : 0
% 1.98/1.47 #Chain : 0
% 1.98/1.47 #Close : 0
% 1.98/1.47
% 1.98/1.47 Ordering : KBO
% 1.98/1.47
% 1.98/1.47 Simplification rules
% 1.98/1.47 ----------------------
% 1.98/1.47 #Subsume : 4
% 1.98/1.47 #Demod : 2
% 1.98/1.47 #Tautology : 0
% 1.98/1.47 #SimpNegUnit : 2
% 1.98/1.47 #BackRed : 0
% 1.98/1.47
% 1.98/1.47 #Partial instantiations: 0
% 1.98/1.47 #Strategies tried : 1
% 1.98/1.47
% 1.98/1.47 Timing (in seconds)
% 1.98/1.47 ----------------------
% 1.98/1.48 Preprocessing : 0.36
% 1.98/1.48 Parsing : 0.21
% 1.98/1.48 CNF conversion : 0.02
% 1.98/1.48 Main loop : 0.06
% 1.98/1.48 Inferencing : 0.00
% 1.98/1.48 Reduction : 0.03
% 1.98/1.48 Demodulation : 0.02
% 1.98/1.48 BG Simplification : 0.01
% 1.98/1.48 Subsumption : 0.02
% 1.98/1.48 Abstraction : 0.00
% 1.98/1.48 MUC search : 0.00
% 1.98/1.48 Cooper : 0.00
% 1.98/1.48 Total : 0.48
% 1.98/1.48 Index Insertion : 0.00
% 1.98/1.48 Index Deletion : 0.00
% 1.98/1.48 Index Matching : 0.00
% 1.98/1.48 BG Taut test : 0.00
%------------------------------------------------------------------------------