TSTP Solution File: PUZ001+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.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:53:49 EDT 2023
% Result : Theorem 2.68s 1.78s
% Output : CNFRefutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 53 ( 24 unt; 9 typ; 0 def)
% Number of atoms : 69 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 49 ( 24 ~; 17 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 25 (; 23 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ richer > killed > hates > lives > #nlpp > charles > butler > agatha > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(charles,type,
charles: $i ).
tff(agatha,type,
agatha: $i ).
tff(butler,type,
butler: $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(lives,type,
lives: $i > $o ).
tff(richer,type,
richer: ( $i * $i ) > $o ).
tff(hates,type,
hates: ( $i * $i ) > $o ).
tff(killed,type,
killed: ( $i * $i ) > $o ).
tff(f_85,axiom,
agatha != butler,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_11) ).
tff(f_40,axiom,
? [X] :
( lives(X)
& killed(X,agatha) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_1) ).
tff(f_55,axiom,
! [X,Y] :
( killed(X,Y)
=> hates(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_4) ).
tff(f_70,axiom,
! [X] :
( ( X != butler )
=> hates(agatha,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_7) ).
tff(f_51,axiom,
! [X] :
( lives(X)
=> ( ( X = agatha )
| ( X = butler )
| ( X = charles ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_3) ).
tff(f_87,negated_conjecture,
~ killed(agatha,agatha),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55) ).
tff(f_65,axiom,
! [X] :
( hates(agatha,X)
=> ~ hates(charles,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_6) ).
tff(f_75,axiom,
! [X] :
( ~ richer(X,agatha)
=> hates(butler,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_8) ).
tff(f_60,axiom,
! [X,Y] :
( killed(X,Y)
=> ~ richer(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_5) ).
tff(f_79,axiom,
! [X] :
( hates(agatha,X)
=> hates(butler,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_9) ).
tff(f_83,axiom,
! [X] :
? [Y] : ~ hates(X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel55_10) ).
tff(c_28,plain,
butler != agatha,
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_2,plain,
killed('#skF_1',agatha),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_51,plain,
! [X_15,Y_16] :
( hates(X_15,Y_16)
| ~ killed(X_15,Y_16) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_55,plain,
hates('#skF_1',agatha),
inference(resolution,[status(thm)],[c_2,c_51]) ).
tff(c_20,plain,
! [X_7] :
( hates(agatha,X_7)
| ( butler = X_7 ) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_4,plain,
lives('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_89,plain,
! [X_22] :
( ( charles = X_22 )
| ( butler = X_22 )
| ( agatha = X_22 )
| ~ lives(X_22) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_102,plain,
( ( charles = '#skF_1' )
| ( butler = '#skF_1' )
| ( agatha = '#skF_1' ) ),
inference(resolution,[status(thm)],[c_4,c_89]) ).
tff(c_113,plain,
agatha = '#skF_1',
inference(splitLeft,[status(thm)],[c_102]) ).
tff(c_30,plain,
~ killed(agatha,agatha),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_123,plain,
~ killed('#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_113,c_113,c_30]) ).
tff(c_124,plain,
killed('#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_113,c_2]) ).
tff(c_139,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_123,c_124]) ).
tff(c_140,plain,
( ( butler = '#skF_1' )
| ( charles = '#skF_1' ) ),
inference(splitRight,[status(thm)],[c_102]) ).
tff(c_142,plain,
charles = '#skF_1',
inference(splitLeft,[status(thm)],[c_140]) ).
tff(c_18,plain,
! [X_6] :
( ~ hates(charles,X_6)
| ~ hates(agatha,X_6) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_151,plain,
! [X_23] :
( ~ hates('#skF_1',X_23)
| ~ hates(agatha,X_23) ),
inference(demodulation,[status(thm),theory(equality)],[c_142,c_18]) ).
tff(c_156,plain,
! [X_24] :
( ~ hates('#skF_1',X_24)
| ( butler = X_24 ) ),
inference(resolution,[status(thm)],[c_20,c_151]) ).
tff(c_159,plain,
butler = agatha,
inference(resolution,[status(thm)],[c_55,c_156]) ).
tff(c_163,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_159]) ).
tff(c_164,plain,
butler = '#skF_1',
inference(splitRight,[status(thm)],[c_140]) ).
tff(c_22,plain,
! [X_8] :
( hates(butler,X_8)
| richer(X_8,agatha) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_79,plain,
! [X_19,Y_20] :
( ~ richer(X_19,Y_20)
| ~ killed(X_19,Y_20) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_84,plain,
! [X_21] :
( ~ killed(X_21,agatha)
| hates(butler,X_21) ),
inference(resolution,[status(thm)],[c_22,c_79]) ).
tff(c_88,plain,
hates(butler,'#skF_1'),
inference(resolution,[status(thm)],[c_2,c_84]) ).
tff(c_167,plain,
hates('#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_164,c_88]) ).
tff(c_56,plain,
! [X_17] :
( hates(butler,X_17)
| ~ hates(agatha,X_17) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_26,plain,
! [X_10] : ~ hates(X_10,'#skF_2'(X_10)),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_61,plain,
~ hates(agatha,'#skF_2'(butler)),
inference(resolution,[status(thm)],[c_56,c_26]) ).
tff(c_66,plain,
'#skF_2'(butler) = butler,
inference(resolution,[status(thm)],[c_20,c_61]) ).
tff(c_170,plain,
'#skF_2'('#skF_1') = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_164,c_164,c_66]) ).
tff(c_193,plain,
~ hates('#skF_1','#skF_1'),
inference(superposition,[status(thm),theory(equality)],[c_170,c_26]) ).
tff(c_198,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_167,c_193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ001+1 : TPTP v8.1.2. Released v2.0.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.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 17:38:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.68/1.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.78
% 2.68/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.68/1.81
% 2.68/1.81 Inference rules
% 2.68/1.81 ----------------------
% 2.68/1.81 #Ref : 0
% 2.68/1.81 #Sup : 35
% 2.68/1.81 #Fact : 0
% 2.68/1.81 #Define : 0
% 2.68/1.81 #Split : 2
% 2.68/1.81 #Chain : 0
% 2.68/1.81 #Close : 0
% 2.68/1.81
% 2.68/1.81 Ordering : KBO
% 2.68/1.81
% 2.68/1.81 Simplification rules
% 2.68/1.81 ----------------------
% 2.68/1.81 #Subsume : 4
% 2.68/1.81 #Demod : 36
% 2.68/1.81 #Tautology : 22
% 2.68/1.81 #SimpNegUnit : 4
% 2.68/1.81 #BackRed : 29
% 2.68/1.81
% 2.68/1.81 #Partial instantiations: 0
% 2.68/1.81 #Strategies tried : 1
% 2.68/1.81
% 2.68/1.81 Timing (in seconds)
% 2.68/1.81 ----------------------
% 2.68/1.82 Preprocessing : 0.45
% 2.68/1.82 Parsing : 0.25
% 2.68/1.82 CNF conversion : 0.03
% 2.68/1.82 Main loop : 0.29
% 2.68/1.82 Inferencing : 0.11
% 2.68/1.82 Reduction : 0.08
% 2.68/1.82 Demodulation : 0.05
% 2.68/1.82 BG Simplification : 0.02
% 2.68/1.82 Subsumption : 0.05
% 2.68/1.82 Abstraction : 0.01
% 2.68/1.82 MUC search : 0.00
% 2.68/1.82 Cooper : 0.00
% 2.68/1.82 Total : 0.79
% 2.68/1.82 Index Insertion : 0.00
% 2.68/1.82 Index Deletion : 0.00
% 2.68/1.82 Index Matching : 0.00
% 2.68/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------