TSTP Solution File: MSC001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MSC001-1 : TPTP v8.1.2. Released v1.0.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 : n032.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:47 EDT 2023
% Result : Unsatisfiable 3.53s 1.88s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 26
% Syntax : Number of formulae : 50 ( 11 unt; 15 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 74 ( 39 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 8 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 73 (; 73 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ at > hold > red > answer > do > #nlpp > thing > taken > go > there > s > pick_up > now > let_go > here > hand
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(let_go,type,
let_go: $i ).
tff(there,type,
there: $i ).
tff(s,type,
s: $i ).
tff(go,type,
go: $i > $i ).
tff(now,type,
now: $i ).
tff(here,type,
here: $i ).
tff(red,type,
red: $i > $o ).
tff(hold,type,
hold: ( $i * $i ) > $o ).
tff(pick_up,type,
pick_up: $i ).
tff(answer,type,
answer: $i > $o ).
tff(thing,type,
thing: $i > $i ).
tff(hand,type,
hand: $i ).
tff(taken,type,
taken: $i > $i ).
tff(at,type,
at: ( $i * $i * $i ) > $o ).
tff(do,type,
do: ( $i * $i ) > $i ).
tff(f_39,axiom,
! [A,B] : at(hand,A,do(go(A),B)),
file(unknown,unknown) ).
tff(f_94,axiom,
! [A,B] :
( ~ at(hand,A,B)
| at(thing(taken(B)),A,B) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B,C] :
( ~ at(hand,A,B)
| ~ at(thing(C),A,B)
| hold(thing(taken(B)),do(pick_up,B)) ),
file(unknown,unknown) ).
tff(f_89,axiom,
! [A,B,C] :
( ~ hold(thing(A),B)
| hold(thing(A),do(go(C),B)) ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [A,B,C] :
( ~ hold(thing(A),B)
| ~ at(hand,C,B)
| at(thing(A),C,B) ),
file(unknown,unknown) ).
tff(f_117,axiom,
! [A] : ~ answer(A),
file(unknown,unknown) ).
tff(f_79,axiom,
! [A,B] :
( ~ red(A)
| ~ at(A,there,B)
| answer(B) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [A,B] : ~ hold(thing(A),do(let_go,B)),
file(unknown,unknown) ).
tff(f_47,axiom,
! [A,B,C] :
( ~ at(thing(A),B,do(go(B),C))
| at(thing(A),B,C)
| hold(thing(A),C) ),
file(unknown,unknown) ).
tff(f_109,axiom,
! [A,B,C] :
( ~ at(A,B,do(let_go,C))
| at(A,B,C) ),
file(unknown,unknown) ).
tff(f_114,axiom,
! [A] :
( ~ at(A,here,now)
| red(A) ),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_5,B_6] : at(hand,A_5,do(go(A_5),B_6)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_26,plain,
! [B_28,A_27] :
( at(thing(taken(B_28)),A_27,B_28)
| ~ at(hand,A_27,B_28) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_235,plain,
! [B_82,C_83,A_84] :
( hold(thing(taken(B_82)),do(pick_up,B_82))
| ~ at(thing(C_83),A_84,B_82)
| ~ at(hand,A_84,B_82) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_258,plain,
! [B_85,A_86] :
( hold(thing(taken(B_85)),do(pick_up,B_85))
| ~ at(hand,A_86,B_85) ),
inference(resolution,[status(thm)],[c_26,c_235]) ).
tff(c_269,plain,
! [A_5,B_6] : hold(thing(taken(do(go(A_5),B_6))),do(pick_up,do(go(A_5),B_6))),
inference(resolution,[status(thm)],[c_8,c_258]) ).
tff(c_24,plain,
! [A_24,C_26,B_25] :
( hold(thing(A_24),do(go(C_26),B_25))
| ~ hold(thing(A_24),B_25) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_126,plain,
! [A_67,C_68,B_69] :
( at(thing(A_67),C_68,B_69)
| ~ at(hand,C_68,B_69)
| ~ hold(thing(A_67),B_69) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_36,plain,
! [A_39] : ~ answer(A_39),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_20,plain,
! [B_20,A_19] :
( answer(B_20)
| ~ at(A_19,there,B_20)
| ~ red(A_19) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_37,plain,
! [A_19,B_20] :
( ~ at(A_19,there,B_20)
| ~ red(A_19) ),
inference(negUnitSimplification,[status(thm)],[c_36,c_20]) ).
tff(c_184,plain,
! [A_74,B_75] :
( ~ red(thing(A_74))
| ~ at(hand,there,B_75)
| ~ hold(thing(A_74),B_75) ),
inference(resolution,[status(thm)],[c_126,c_37]) ).
tff(c_458,plain,
! [A_101,C_102,B_103] :
( ~ red(thing(A_101))
| ~ at(hand,there,do(go(C_102),B_103))
| ~ hold(thing(A_101),B_103) ),
inference(resolution,[status(thm)],[c_24,c_184]) ).
tff(c_463,plain,
! [A_104,B_105] :
( ~ red(thing(A_104))
| ~ hold(thing(A_104),B_105) ),
inference(resolution,[status(thm)],[c_8,c_458]) ).
tff(c_470,plain,
! [A_5,B_6] : ~ red(thing(taken(do(go(A_5),B_6)))),
inference(resolution,[status(thm)],[c_269,c_463]) ).
tff(c_4,plain,
! [A_3,B_4] : ~ hold(thing(A_3),do(let_go,B_4)),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_281,plain,
! [A_89,C_90,B_91] :
( hold(thing(A_89),C_90)
| at(thing(A_89),B_91,C_90)
| ~ at(thing(A_89),B_91,do(go(B_91),C_90)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_292,plain,
! [A_27,C_90] :
( hold(thing(taken(do(go(A_27),C_90))),C_90)
| at(thing(taken(do(go(A_27),C_90))),A_27,C_90)
| ~ at(hand,A_27,do(go(A_27),C_90)) ),
inference(resolution,[status(thm)],[c_26,c_281]) ).
tff(c_553,plain,
! [A_120,C_121] :
( hold(thing(taken(do(go(A_120),C_121))),C_121)
| at(thing(taken(do(go(A_120),C_121))),A_120,C_121) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_292]) ).
tff(c_32,plain,
! [A_35,B_36,C_37] :
( at(A_35,B_36,C_37)
| ~ at(A_35,B_36,do(let_go,C_37)) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_584,plain,
! [A_120,C_37] :
( at(thing(taken(do(go(A_120),do(let_go,C_37)))),A_120,C_37)
| hold(thing(taken(do(go(A_120),do(let_go,C_37)))),do(let_go,C_37)) ),
inference(resolution,[status(thm)],[c_553,c_32]) ).
tff(c_639,plain,
! [A_123,C_124] : at(thing(taken(do(go(A_123),do(let_go,C_124)))),A_123,C_124),
inference(negUnitSimplification,[status(thm)],[c_4,c_584]) ).
tff(c_34,plain,
! [A_38] :
( red(A_38)
| ~ at(A_38,here,now) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_678,plain,
red(thing(taken(do(go(here),do(let_go,now))))),
inference(resolution,[status(thm)],[c_639,c_34]) ).
tff(c_691,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_470,c_678]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % 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.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 13:13:21 EDT 2023
% 0.12/0.33 % CPUTime :
% 3.53/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.53/1.89
% 3.53/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.92
% 3.62/1.92 Inference rules
% 3.62/1.92 ----------------------
% 3.62/1.92 #Ref : 0
% 3.62/1.92 #Sup : 127
% 3.62/1.92 #Fact : 0
% 3.62/1.92 #Define : 0
% 3.62/1.92 #Split : 2
% 3.62/1.92 #Chain : 0
% 3.62/1.92 #Close : 0
% 3.62/1.92
% 3.62/1.92 Ordering : KBO
% 3.62/1.92
% 3.62/1.92 Simplification rules
% 3.62/1.92 ----------------------
% 3.62/1.92 #Subsume : 37
% 3.62/1.92 #Demod : 4
% 3.62/1.92 #Tautology : 8
% 3.62/1.92 #SimpNegUnit : 6
% 3.62/1.92 #BackRed : 0
% 3.62/1.92
% 3.62/1.92 #Partial instantiations: 0
% 3.62/1.92 #Strategies tried : 1
% 3.62/1.92
% 3.62/1.92 Timing (in seconds)
% 3.62/1.92 ----------------------
% 3.62/1.93 Preprocessing : 0.47
% 3.62/1.93 Parsing : 0.27
% 3.62/1.93 CNF conversion : 0.03
% 3.62/1.93 Main loop : 0.48
% 3.62/1.93 Inferencing : 0.20
% 3.62/1.93 Reduction : 0.12
% 3.62/1.93 Demodulation : 0.08
% 3.62/1.93 BG Simplification : 0.02
% 3.62/1.93 Subsumption : 0.11
% 3.62/1.93 Abstraction : 0.02
% 3.62/1.93 MUC search : 0.00
% 3.62/1.93 Cooper : 0.00
% 3.62/1.93 Total : 1.00
% 3.62/1.93 Index Insertion : 0.00
% 3.62/1.93 Index Deletion : 0.00
% 3.62/1.93 Index Matching : 0.00
% 3.62/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------