TSTP Solution File: COM003-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM003-2 : TPTP v8.1.2. Released v1.1.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 : n016.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:35:15 EDT 2023
% Result : Unsatisfiable 3.61s 1.82s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 35
% Syntax : Number of formulae : 55 ( 13 unt; 27 typ; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 38 ( 23 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 21 >; 23 *; 0 +; 0 <<)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 54 (; 54 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ program_not_halts2_halts3_outputs > program_halts2_halts3_outputs > halts3_outputs > program_not_halts2_halts2_outputs > program_halts2_halts2_outputs > halts3 > halts2_outputs > decides > program_not_halts2 > program_halts2 > outputs > halts2 > program_program_decides > program_decides > program > algorithm_program_decides > algorithm > #nlpp > f4 > f3 > f2 > f1 > good > c4 > c3 > c2 > c1 > bad
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f3,type,
f3: $i > $i ).
tff(bad,type,
bad: $i ).
tff(algorithm,type,
algorithm: $i > $o ).
tff(algorithm_program_decides,type,
algorithm_program_decides: $i > $o ).
tff(halts3_outputs,type,
halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(c3,type,
c3: $i ).
tff(c1,type,
c1: $i ).
tff(f1,type,
f1: $i > $i ).
tff(program_decides,type,
program_decides: $i > $o ).
tff(halts2,type,
halts2: ( $i * $i ) > $o ).
tff(program_not_halts2,type,
program_not_halts2: ( $i * $i ) > $o ).
tff(c2,type,
c2: $i ).
tff(program_not_halts2_halts2_outputs,type,
program_not_halts2_halts2_outputs: ( $i * $i * $i ) > $o ).
tff(f2,type,
f2: $i > $i ).
tff(program_program_decides,type,
program_program_decides: $i > $o ).
tff(program_halts2_halts2_outputs,type,
program_halts2_halts2_outputs: ( $i * $i * $i ) > $o ).
tff(outputs,type,
outputs: ( $i * $i ) > $o ).
tff(program_halts2,type,
program_halts2: ( $i * $i ) > $o ).
tff(f4,type,
f4: $i > $i ).
tff(halts3,type,
halts3: ( $i * $i * $i ) > $o ).
tff(good,type,
good: $i ).
tff(program,type,
program: $i > $o ).
tff(decides,type,
decides: ( $i * $i * $i ) > $o ).
tff(halts2_outputs,type,
halts2_outputs: ( $i * $i * $i ) > $o ).
tff(program_halts2_halts3_outputs,type,
program_halts2_halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(program_not_halts2_halts3_outputs,type,
program_not_halts2_halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(c4,type,
c4: $i ).
tff(f_265,axiom,
! [W,Y,Z] :
( ~ program_program_decides(W)
| program_not_halts2_halts3_outputs(W,Y,Z,bad) ),
file(unknown,unknown) ).
tff(f_191,axiom,
! [X,Y,Z,W] :
( ~ program_not_halts2_halts3_outputs(X,Y,Z,W)
| program_not_halts2(Y,Z) ),
file(unknown,unknown) ).
tff(f_252,axiom,
! [X] :
( ~ algorithm_program_decides(X)
| program_program_decides(c1) ),
file(unknown,unknown) ).
tff(f_348,axiom,
algorithm_program_decides(c4),
file(unknown,unknown) ).
tff(f_135,axiom,
! [X,Y] :
( ~ program_not_halts2(X,Y)
| ~ halts2(X,Y) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [X,Y] :
( ~ program_halts2(X,Y)
| halts2(X,Y) ),
file(unknown,unknown) ).
tff(f_170,axiom,
! [X,Y,Z,W] :
( ~ program_halts2_halts3_outputs(X,Y,Z,W)
| program_halts2(Y,Z) ),
file(unknown,unknown) ).
tff(f_260,axiom,
! [W,Y,Z] :
( ~ program_program_decides(W)
| program_halts2_halts3_outputs(W,Y,Z,good) ),
file(unknown,unknown) ).
tff(c_72,plain,
! [W_91,Y_92,Z_93] :
( program_not_halts2_halts3_outputs(W_91,Y_92,Z_93,bad)
| ~ program_program_decides(W_91) ),
inference(cnfTransformation,[status(thm)],[f_265]) ).
tff(c_158,plain,
! [Y_151,Z_152,X_153,W_154] :
( program_not_halts2(Y_151,Z_152)
| ~ program_not_halts2_halts3_outputs(X_153,Y_151,Z_152,W_154) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_162,plain,
! [Y_92,Z_93,W_91] :
( program_not_halts2(Y_92,Z_93)
| ~ program_program_decides(W_91) ),
inference(resolution,[status(thm)],[c_72,c_158]) ).
tff(c_163,plain,
! [W_91] : ~ program_program_decides(W_91),
inference(splitLeft,[status(thm)],[c_162]) ).
tff(c_68,plain,
! [X_87] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X_87) ),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_87,plain,
! [X_87] : ~ algorithm_program_decides(X_87),
inference(splitLeft,[status(thm)],[c_68]) ).
tff(c_86,plain,
algorithm_program_decides(c4),
inference(cnfTransformation,[status(thm)],[f_348]) ).
tff(c_89,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_87,c_86]) ).
tff(c_90,plain,
program_program_decides(c1),
inference(splitRight,[status(thm)],[c_68]) ).
tff(c_166,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_163,c_90]) ).
tff(c_167,plain,
! [Y_92,Z_93] : program_not_halts2(Y_92,Z_93),
inference(splitRight,[status(thm)],[c_162]) ).
tff(c_34,plain,
! [X_32,Y_33] :
( ~ halts2(X_32,Y_33)
| ~ program_not_halts2(X_32,Y_33) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_172,plain,
! [X_32,Y_33] : ~ halts2(X_32,Y_33),
inference(demodulation,[status(thm),theory(equality)],[c_167,c_34]) ).
tff(c_22,plain,
! [X_14,Y_15] :
( halts2(X_14,Y_15)
| ~ program_halts2(X_14,Y_15) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_194,plain,
! [X_14,Y_15] : ~ program_halts2(X_14,Y_15),
inference(negUnitSimplification,[status(thm)],[c_172,c_22]) ).
tff(c_44,plain,
! [Y_46,Z_47,X_45,W_48] :
( program_halts2(Y_46,Z_47)
| ~ program_halts2_halts3_outputs(X_45,Y_46,Z_47,W_48) ),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_209,plain,
! [X_45,Y_46,Z_47,W_48] : ~ program_halts2_halts3_outputs(X_45,Y_46,Z_47,W_48),
inference(negUnitSimplification,[status(thm)],[c_194,c_44]) ).
tff(c_70,plain,
! [W_88,Y_89,Z_90] :
( program_halts2_halts3_outputs(W_88,Y_89,Z_90,good)
| ~ program_program_decides(W_88) ),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_210,plain,
! [W_88] : ~ program_program_decides(W_88),
inference(negUnitSimplification,[status(thm)],[c_209,c_70]) ).
tff(c_214,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_210,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM003-2 : TPTP v8.1.2. Released v1.1.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.15/0.34 % Computer : n016.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri Aug 4 00:02:38 EDT 2023
% 0.15/0.34 % CPUTime :
% 3.61/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.61/1.82
% 3.61/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.61/1.85
% 3.61/1.85 Inference rules
% 3.61/1.85 ----------------------
% 3.61/1.85 #Ref : 0
% 3.61/1.85 #Sup : 14
% 3.61/1.85 #Fact : 0
% 3.61/1.85 #Define : 0
% 3.61/1.85 #Split : 3
% 3.61/1.85 #Chain : 0
% 3.61/1.85 #Close : 0
% 3.61/1.85
% 3.61/1.85 Ordering : KBO
% 3.61/1.85
% 3.61/1.85 Simplification rules
% 3.61/1.85 ----------------------
% 3.61/1.85 #Subsume : 8
% 3.61/1.85 #Demod : 12
% 3.61/1.85 #Tautology : 16
% 3.61/1.85 #SimpNegUnit : 12
% 3.61/1.85 #BackRed : 16
% 3.61/1.85
% 3.61/1.85 #Partial instantiations: 0
% 3.61/1.85 #Strategies tried : 1
% 3.61/1.85
% 3.61/1.85 Timing (in seconds)
% 3.61/1.85 ----------------------
% 3.61/1.85 Preprocessing : 0.51
% 3.61/1.85 Parsing : 0.29
% 3.61/1.85 CNF conversion : 0.03
% 3.61/1.85 Main loop : 0.28
% 3.61/1.85 Inferencing : 0.11
% 3.61/1.85 Reduction : 0.07
% 3.61/1.85 Demodulation : 0.05
% 3.61/1.85 BG Simplification : 0.03
% 3.61/1.85 Subsumption : 0.05
% 3.61/1.85 Abstraction : 0.01
% 3.61/1.85 MUC search : 0.00
% 3.61/1.85 Cooper : 0.00
% 3.61/1.85 Total : 0.84
% 3.87/1.85 Index Insertion : 0.00
% 3.87/1.85 Index Deletion : 0.00
% 3.87/1.85 Index Matching : 0.00
% 3.87/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------