TSTP Solution File: LCL569+1 by DarwinFM---1.4.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DarwinFM---1.4.5
% Problem : LCL569+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : darwin -fd true -ppp true -pl 0 -to %d -pmtptp true %s
% Computer : n013.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 : 0s
% DateTime : Sun Jul 17 08:56:11 EDT 2022
% Result : CounterSatisfiable 5.05s 5.22s
% Output : FiniteModel 5.05s
% Verified :
% SZS Type : FiniteModel
% Domain size : 2
% Comments :
%------------------------------------------------------------------------------
fof(interpretation_domain,fi_domain,
! [X] :
( X = e1
| X = e2 ) ).
fof(interpretation_domain_distinct,fi_domain,
e1 != e2 ).
fof(interpretation_terms,fi_functors,
( ! [X0,X1,X2] :
( and(X0,X1) = X2
<=> ( ( X1 = e2
& X2 = e2 )
| ( X2 = e1
& X0 != e2
& X1 != e2 )
| ( X0 = e2
& X2 = e2 ) ) )
& ! [X0,X1] : equiv(X0,X1) = e2
& esk10_0 = e1
& esk11_0 = e1
& esk12_0 = e2
& esk13_0 = e1
& esk14_0 = e1
& esk15_0 = e1
& esk16_0 = e1
& esk17_0 = e1
& esk18_0 = e1
& esk19_0 = e1
& esk1_0 = e1
& esk20_0 = e1
& esk21_0 = e2
& esk22_0 = e1
& esk23_0 = e1
& esk24_0 = e1
& esk25_0 = e1
& esk26_0 = e1
& esk27_0 = e1
& esk28_0 = e1
& esk29_0 = e1
& esk2_0 = e1
& esk30_0 = e1
& esk31_0 = e1
& esk32_0 = e1
& esk33_0 = e1
& esk34_0 = e2
& esk35_0 = e1
& esk36_0 = e1
& esk37_0 = e1
& esk38_0 = e1
& esk39_0 = e1
& esk3_0 = e1
& esk4_0 = e1
& esk5_0 = e1
& esk6_0 = e1
& esk7_0 = e1
& esk8_0 = e1
& esk9_0 = e2
& ! [X0,X1,X2] :
( implies(X0,X1) = X2
<=> ( ( X2 = e2
& X1 != e2 )
| ( X1 = e2
& X2 = e1
& X0 != e2 )
| ( X0 = e2
& X2 = e2 ) ) )
& ! [X0,X1] :
( necessarily(X0) = X1
<=> ( ( X0 = e1
& X1 = e2 )
| ( X1 = e1
& X0 != e1 ) ) )
& ! [X0] : not(X0) = e1
& ! [X0,X1] : or(X0,X1) = e1
& ! [X0] : possibly(X0) = e1
& ! [X0,X1,X2] :
( strict_equiv(X0,X1) = X2
<=> ( ( X2 = e1
& X0 != e2
& X1 != e2 )
| ( X1 = e2
& X2 = e2
& X0 != e2 )
| ( X0 = e2
& X2 = e2
& X1 != e2 )
| ( X0 = e2
& X1 = e2
& X2 = e1 ) ) )
& ! [X0,X1,X2] :
( strict_implies(X0,X1) = X2
<=> ( ( X0 = e1
& X2 = e1
& X1 != e2 )
| ( X2 = e1
& X1 != e2 )
| ( X1 = e2
& X2 = e2
& X0 != e2 )
| ( X0 = e2
& X2 = e1 ) ) ) ) ).
fof(interpretation_atoms,fi_predicates,
( adjunction
& ( axiom_4
<=> $false )
& axiom_5
& ( axiom_B
<=> $false )
& ( axiom_K
<=> $false )
& ( axiom_M
<=> $false )
& axiom_b
& axiom_m1
& ( axiom_m10
<=> $false )
& axiom_m2
& axiom_m3
& axiom_m4
& axiom_m5
& axiom_m6
& ( axiom_m7
<=> $false )
& axiom_m8
& axiom_m9
& ( axiom_s1
<=> $false )
& axiom_s2
& axiom_s3
& ( axiom_s4
<=> $false )
& ! [X0] :
( is_a_theorem(X0)
<=> X0 != e2 )
& modus_ponens_strict_implies
& ( necessitation
<=> $false )
& ( op_and
<=> $false )
& op_equiv
& op_implies
& ( op_implies_and
<=> $false )
& ( op_implies_or
<=> $false )
& ( op_necessarily
<=> $false )
& op_or
& op_possibly
& op_strict_equiv
& op_strict_implies
& substitution_strict_equiv ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL569+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : darwin -fd true -ppp true -pl 0 -to %d -pmtptp true %s
% 0.14/0.34 % Computer : n013.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 % DateTime : Mon Jul 4 20:20:59 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 Defaulting to tptp format.
% 5.05/5.22 SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.05/5.22
% 5.05/5.22 MODEL (TPTP):
% 5.05/5.22 SZS output start FiniteModel for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------