TSTP Solution File: CSR147+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR147+1 : TPTP v8.1.2. Released v4.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 : n029.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:36:45 EDT 2023
% Result : Theorem 2.82s 1.78s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 33 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 39 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 33 ( 14 ~; 15 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ s__more_experienced > s__has_seen_more > s__age > greater > s__LivingThing > s__Human > #nlpp > s__siblingFn > n54 > n48 > jim > geoff > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(geoff,type,
geoff: $i ).
tff(s__more_experienced,type,
s__more_experienced: ( $i * $i ) > $o ).
tff(jim,type,
jim: $i ).
tff(n54,type,
n54: $i ).
tff(s__has_seen_more,type,
s__has_seen_more: ( $i * $i ) > $o ).
tff(n48,type,
n48: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(s__LivingThing,type,
s__LivingThing: $i > $o ).
tff(s__siblingFn,type,
s__siblingFn: $i > $i ).
tff(s__Human,type,
s__Human: $i > $o ).
tff(s__age,type,
s__age: ( $i * $i ) > $o ).
tff(f_67,negated_conjecture,
~ s__more_experienced(jim,geoff),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jim_is_experienced) ).
tff(f_65,axiom,
~ s__has_seen_more(geoff,jim),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jim_has_seen_more) ).
tff(f_35,axiom,
s__Human(jim),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jim_human) ).
tff(f_61,axiom,
s__age(jim,n54),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jim_54) ).
tff(f_60,axiom,
s__age(geoff,n48),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',geoff_48) ).
tff(f_63,axiom,
geoff = s__siblingFn(jim),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',geoff_and_jim) ).
tff(f_62,axiom,
greater(n54,n48),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greater_54_48) ).
tff(f_51,axiom,
! [O,OAge,YAge] :
( s__Human(O)
=> ( ( s__age(O,OAge)
& s__age(s__siblingFn(O),YAge)
& greater(OAge,YAge) )
=> ( s__more_experienced(O,s__siblingFn(O))
| s__has_seen_more(s__siblingFn(O),O) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',experience) ).
tff(c_28,plain,
~ s__more_experienced(jim,geoff),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_26,plain,
~ s__has_seen_more(geoff,jim),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_10,plain,
s__Human(jim),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_20,plain,
s__age(jim,n54),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_18,plain,
s__age(geoff,n48),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_24,plain,
s__siblingFn(jim) = geoff,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_22,plain,
greater(n54,n48),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_94,plain,
! [O_12,OAge_13,YAge_14] :
( s__has_seen_more(s__siblingFn(O_12),O_12)
| s__more_experienced(O_12,s__siblingFn(O_12))
| ~ greater(OAge_13,YAge_14)
| ~ s__age(s__siblingFn(O_12),YAge_14)
| ~ s__age(O_12,OAge_13)
| ~ s__Human(O_12) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_98,plain,
! [O_15] :
( s__has_seen_more(s__siblingFn(O_15),O_15)
| s__more_experienced(O_15,s__siblingFn(O_15))
| ~ s__age(s__siblingFn(O_15),n48)
| ~ s__age(O_15,n54)
| ~ s__Human(O_15) ),
inference(resolution,[status(thm)],[c_22,c_94]) ).
tff(c_107,plain,
( s__has_seen_more(s__siblingFn(jim),jim)
| s__more_experienced(jim,geoff)
| ~ s__age(s__siblingFn(jim),n48)
| ~ s__age(jim,n54)
| ~ s__Human(jim) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_98]) ).
tff(c_111,plain,
( s__has_seen_more(geoff,jim)
| s__more_experienced(jim,geoff) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_20,c_18,c_24,c_24,c_107]) ).
tff(c_113,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_26,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR147+1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.13 % 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.34 % Computer : n029.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 21:00:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.82/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.78
% 2.82/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.07/1.81
% 3.07/1.81 Inference rules
% 3.07/1.81 ----------------------
% 3.07/1.81 #Ref : 0
% 3.07/1.81 #Sup : 20
% 3.07/1.81 #Fact : 0
% 3.07/1.81 #Define : 0
% 3.07/1.81 #Split : 0
% 3.07/1.81 #Chain : 0
% 3.07/1.81 #Close : 0
% 3.07/1.81
% 3.07/1.81 Ordering : KBO
% 3.07/1.81
% 3.07/1.81 Simplification rules
% 3.07/1.81 ----------------------
% 3.07/1.81 #Subsume : 1
% 3.07/1.81 #Demod : 23
% 3.07/1.81 #Tautology : 14
% 3.07/1.81 #SimpNegUnit : 1
% 3.07/1.81 #BackRed : 0
% 3.07/1.81
% 3.07/1.81 #Partial instantiations: 0
% 3.07/1.81 #Strategies tried : 1
% 3.07/1.81
% 3.07/1.81 Timing (in seconds)
% 3.07/1.81 ----------------------
% 3.09/1.81 Preprocessing : 0.47
% 3.09/1.81 Parsing : 0.25
% 3.09/1.81 CNF conversion : 0.03
% 3.09/1.81 Main loop : 0.21
% 3.09/1.81 Inferencing : 0.09
% 3.09/1.81 Reduction : 0.06
% 3.09/1.81 Demodulation : 0.04
% 3.09/1.81 BG Simplification : 0.01
% 3.09/1.81 Subsumption : 0.04
% 3.09/1.81 Abstraction : 0.01
% 3.09/1.81 MUC search : 0.00
% 3.09/1.81 Cooper : 0.00
% 3.09/1.81 Total : 0.73
% 3.09/1.81 Index Insertion : 0.00
% 3.09/1.81 Index Deletion : 0.00
% 3.09/1.81 Index Matching : 0.00
% 3.09/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------