TSTP Solution File: SYN095-1.002 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n017.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 11:09:36 EDT 2023
% Result : Unsatisfiable 2.55s 1.62s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 (; 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q_2_2 > q_1_2 > q_1_1 > p_2_2 > p_1_2 > p_1_1 > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_2_2,type,
p_2_2: $i > $o ).
tff(a,type,
a: $i ).
tff(p_1_2,type,
p_1_2: $i > $o ).
tff(p_1_1,type,
p_1_1: $i > $o ).
tff(q_2_2,type,
q_2_2: $i > $o ).
tff(q_1_2,type,
q_1_2: $i > $o ).
tff(q_1_1,type,
q_1_1: $i > $o ).
tff(f_80,axiom,
p_1_1(a),
file(unknown,unknown) ).
tff(f_82,axiom,
p_2_2(a),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X] : ~ p_1_2(X),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X] :
( p_1_2(X)
| ~ p_2_2(X)
| ~ p_1_1(X) ),
file(unknown,unknown) ).
tff(c_20,plain,
p_1_1(a),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_24,plain,
p_2_2(a),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_2,plain,
! [X_1] : ~ p_1_2(X_1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [X_2] :
( ~ p_1_1(X_2)
| ~ p_2_2(X_2)
| p_1_2(X_2) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_30,plain,
! [X_11] :
( ~ p_1_1(X_11)
| ~ p_2_2(X_11) ),
inference(negUnitSimplification,[status(thm)],[c_2,c_4]) ).
tff(c_33,plain,
~ p_1_1(a),
inference(resolution,[status(thm)],[c_24,c_30]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN095-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.14/0.37 % Computer : n017.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 16:57:21 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.55/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/1.62
% 2.55/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.66/1.65
% 2.66/1.65 Inference rules
% 2.66/1.65 ----------------------
% 2.66/1.65 #Ref : 0
% 2.66/1.65 #Sup : 1
% 2.66/1.65 #Fact : 0
% 2.66/1.65 #Define : 0
% 2.66/1.65 #Split : 0
% 2.66/1.65 #Chain : 0
% 2.66/1.65 #Close : 0
% 2.66/1.65
% 2.66/1.65 Ordering : KBO
% 2.66/1.65
% 2.66/1.65 Simplification rules
% 2.66/1.65 ----------------------
% 2.66/1.65 #Subsume : 2
% 2.66/1.65 #Demod : 1
% 2.66/1.65 #Tautology : 0
% 2.66/1.65 #SimpNegUnit : 2
% 2.66/1.65 #BackRed : 0
% 2.66/1.65
% 2.66/1.65 #Partial instantiations: 0
% 2.66/1.65 #Strategies tried : 1
% 2.66/1.65
% 2.66/1.65 Timing (in seconds)
% 2.66/1.65 ----------------------
% 2.66/1.65 Preprocessing : 0.41
% 2.66/1.65 Parsing : 0.22
% 2.66/1.65 CNF conversion : 0.02
% 2.66/1.65 Main loop : 0.16
% 2.66/1.65 Inferencing : 0.07
% 2.66/1.65 Reduction : 0.04
% 2.66/1.65 Demodulation : 0.03
% 2.66/1.65 BG Simplification : 0.02
% 2.66/1.65 Subsumption : 0.04
% 2.66/1.65 Abstraction : 0.01
% 2.66/1.65 MUC search : 0.00
% 2.66/1.65 Cooper : 0.00
% 2.66/1.65 Total : 0.61
% 2.66/1.65 Index Insertion : 0.00
% 2.66/1.65 Index Deletion : 0.00
% 2.66/1.65 Index Matching : 0.00
% 2.66/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------