TSTP Solution File: PUZ067+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ067+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n025.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 : 600s
% DateTime : Mon Jul 18 18:11:05 EDT 2022
% Result : Satisfiable 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ067+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 20:06:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.48 #
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48 # Number of axioms: 1350 Number of unprocessed: 118
% 0.18/0.48 # Tableaux proof search.
% 0.18/0.48 # APR header successfully linked.
% 0.18/0.48 # Hello from C++
% 0.18/0.48 # The folding up rule is enabled...
% 0.18/0.48 # Local unification is enabled...
% 0.18/0.48 # Any saturation attempts will use folding labels...
% 0.18/0.48 # 118 beginning clauses after preprocessing and clausification
% 0.18/0.48 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.18/0.48 # No conjectures.
% 0.18/0.48 # There are 118 start rule candidates:
% 0.18/0.48 # Found 118 unit axioms.
% 0.18/0.48 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.48 # 118 start rule tableaux created.
% 0.18/0.48 # 0 extension rule candidate clauses
% 0.18/0.48 # 118 unit axiom clauses
% 0.18/0.48
% 0.18/0.48 # Requested 8, 32 cores available to the main process.
% 0.18/0.50 # Creating equality axioms
% 0.18/0.50 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.50 # 23200 Satisfiable branch
% 0.18/0.50 # Satisfiable branch found.
% 0.18/0.50 # There were 1 total branch saturation attempts.
% 0.18/0.50 # There were 0 of these attempts blocked.
% 0.18/0.50 # There were 0 deferred branch saturation attempts.
% 0.18/0.50 # There were 0 free duplicated saturations.
% 0.18/0.50 # There were 0 total successful branch saturations.
% 0.18/0.50 # There were 0 successful branch saturations in interreduction.
% 0.18/0.50 # There were 0 successful branch saturations on the branch.
% 0.18/0.50 # There were 0 successful branch saturations after the branch.
% 0.18/0.50 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.50 # Begin clausification derivation
% 0.18/0.50
% 0.18/0.50 # End clausification derivation
% 0.18/0.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.50 cnf(i_0_1334, plain, (ssA(n1,n4)=n4)).
% 0.18/0.50 cnf(i_0_1335, plain, (ssA(n1,n5)=n7)).
% 0.18/0.50 cnf(i_0_1336, plain, (ssA(n1,n7)=n1)).
% 0.18/0.50 cnf(i_0_1337, plain, (ssA(n2,n2)=n5)).
% 0.18/0.50 cnf(i_0_1338, plain, (ssA(n2,n4)=n2)).
% 0.18/0.50 cnf(i_0_1339, plain, (ssA(n3,n2)=n3)).
% 0.18/0.50 cnf(i_0_1340, plain, (ssA(n3,n9)=n8)).
% 0.18/0.50 cnf(i_0_1341, plain, (ssA(n4,n1)=n6)).
% 0.18/0.50 cnf(i_0_1342, plain, (ssA(n4,n5)=n1)).
% 0.18/0.50 cnf(i_0_1343, plain, (ssA(n4,n7)=n7)).
% 0.18/0.50 cnf(i_0_1344, plain, (ssA(n5,n3)=n4)).
% 0.18/0.50 cnf(i_0_1345, plain, (ssA(n5,n6)=n3)).
% 0.18/0.50 cnf(i_0_1346, plain, (ssA(n6,n8)=n5)).
% 0.18/0.50 cnf(i_0_1347, plain, (ssA(n7,n4)=n7)).
% 0.18/0.50 cnf(i_0_1348, plain, (ssA(n7,n8)=n3)).
% 0.18/0.50 cnf(i_0_1349, plain, (ssA(n8,n1)=n1)).
% 0.18/0.50 cnf(i_0_1350, plain, (ssA(n9,n9)=n4)).
% 0.18/0.50 cnf(i_0_894, plain, (ssA(n2,n5)=n3)).
% 0.18/0.50 cnf(i_0_39, plain, (ssA(n1,n9)=n3)).
% 0.18/0.50 cnf(i_0_41, plain, (ssA(n1,n6)=n5)).
% 0.18/0.50 cnf(i_0_899, plain, (ssA(n2,n6)=n8)).
% 0.18/0.50 cnf(i_0_673, plain, (ssA(n6,n6)=n7)).
% 0.18/0.50 cnf(i_0_714, plain, (ssA(n6,n7)=n3)).
% 0.18/0.50 cnf(i_0_444, plain, (ssA(n9,n1)=n3)).
% 0.18/0.50 cnf(i_0_579, plain, (ssA(n8,n4)=n3)).
% 0.18/0.50 cnf(i_0_534, plain, (ssA(n4,n3)=n3)).
% 0.18/0.50 cnf(i_0_941, plain, (ssA(n3,n7)=n5)).
% 0.18/0.50 cnf(i_0_715, plain, (ssA(n2,n7)=n4)).
% 0.18/0.50 cnf(i_0_850, plain, (ssA(n3,n1)=n4)).
% 0.18/0.50 cnf(i_0_760, plain, (ssA(n4,n8)=n4)).
% 0.18/0.50 cnf(i_0_82, plain, (ssA(n2,n3)=n1)).
% 0.18/0.50 cnf(i_0_176, plain, (ssA(n4,n4)=n5)).
% 0.18/0.50 cnf(i_0_986, plain, (ssA(n5,n1)=n5)).
% 0.18/0.50 cnf(i_0_448, plain, (ssA(n2,n1)=n7)).
% 0.18/0.50 cnf(i_0_133, plain, (ssA(n3,n8)=n7)).
% 0.18/0.50 cnf(i_0_808, plain, (ssA(n8,n9)=n7)).
% 0.18/0.50 cnf(i_0_538, plain, (ssA(n9,n3)=n7)).
% 0.18/0.50 cnf(i_0_493, plain, (ssA(n5,n2)=n7)).
% 0.18/0.50 cnf(i_0_487, plain, (ssA(n6,n2)=n1)).
% 0.18/0.50 cnf(i_0_179, plain, (ssA(n4,n2)=n8)).
% 0.18/0.50 cnf(i_0_1030, plain, (ssA(n6,n5)=n4)).
% 0.18/0.50 cnf(i_0_269, plain, (ssA(n6,n4)=n8)).
% 0.18/0.50 cnf(i_0_267, plain, (ssA(n6,n9)=n6)).
% 0.18/0.50 cnf(i_0_87, plain, (ssA(n2,n8)=n6)).
% 0.18/0.50 cnf(i_0_1269, plain, (ssA(n2,n9)=n9)).
% 0.18/0.50 cnf(i_0_180, plain, (ssA(n4,n6)=n9)).
% 0.18/0.50 cnf(i_0_1287, plain, (ssA(n4,n9)=n2)).
% 0.18/0.50 cnf(i_0_1028, plain, (ssA(n5,n5)=n2)).
% 0.18/0.50 cnf(i_0_1291, plain, (ssA(n5,n4)=n6)).
% 0.18/0.50 cnf(i_0_1259, plain, (ssA(n1,n8)=n2)).
% 0.18/0.50 cnf(i_0_1296, plain, (ssA(n5,n9)=n1)).
% 0.18/0.50 cnf(i_0_757, plain, (ssA(n9,n8)=n1)).
% 0.18/0.50 cnf(i_0_577, plain, (ssA(n3,n4)=n1)).
% 0.18/0.50 cnf(i_0_585, plain, (ssA(n9,n4)=n9)).
% 0.18/0.50 cnf(i_0_900, plain, (ssA(n3,n5)=n9)).
% 0.18/0.50 cnf(i_0_897, plain, (ssA(n3,n6)=n6)).
% 0.18/0.50 cnf(i_0_667, plain, (ssA(n7,n6)=n1)).
% 0.18/0.50 cnf(i_0_848, plain, (ssA(n3,n3)=n2)).
% 0.18/0.50 cnf(i_0_670, plain, (ssA(n8,n6)=n4)).
% 0.18/0.50 cnf(i_0_668, plain, (ssA(n9,n6)=n2)).
% 0.18/0.50 cnf(i_0_983, plain, (ssA(n6,n1)=n2)).
% 0.18/0.50 cnf(i_0_990, plain, (ssA(n6,n3)=n9)).
% 0.18/0.50 cnf(i_0_490, plain, (ssA(n7,n2)=n4)).
% 0.18/0.50 cnf(i_0_488, plain, (ssA(n8,n2)=n2)).
% 0.18/0.50 cnf(i_0_495, plain, (ssA(n1,n2)=n9)).
% 0.18/0.50 cnf(i_0_492, plain, (ssA(n9,n2)=n6)).
% 0.18/0.50 cnf(i_0_713, plain, (ssA(n7,n7)=n2)).
% 0.18/0.50 cnf(i_0_450, plain, (ssA(n7,n1)=n9)).
% 0.18/0.50 cnf(i_0_1252, plain, (ssA(n1,n1)=n8)).
% 0.18/0.50 cnf(i_0_717, plain, (ssA(n8,n7)=n6)).
% 0.18/0.50 cnf(i_0_537, plain, (ssA(n1,n3)=n6)).
% 0.18/0.50 cnf(i_0_627, plain, (ssA(n7,n5)=n6)).
% 0.18/0.50 cnf(i_0_314, plain, (ssA(n7,n3)=n8)).
% 0.18/0.50 cnf(i_0_1121, plain, (ssA(n8,n3)=n5)).
% 0.18/0.50 cnf(i_0_311, plain, (ssA(n7,n9)=n5)).
% 0.18/0.50 cnf(i_0_626, plain, (ssA(n9,n5)=n5)).
% 0.18/0.50 cnf(i_0_1169, plain, (ssA(n8,n5)=n8)).
% 0.18/0.50 cnf(i_0_764, plain, (ssA(n5,n8)=n8)).
% 0.18/0.50 cnf(i_0_765, plain, (ssA(n8,n8)=n9)).
% 0.18/0.50 cnf(i_0_1294, plain, (ssA(n5,n7)=n9)).
% 0.18/0.50 cnf(i_0_719, plain, (ssA(n9,n7)=n8)).
% 0.18/0.50 cnf(i_0_1333, plain, (ssP(n8,n9,n6,n4,n7,n5,n1,n2,n3,n7,n5,n1,n2,n3,n8,n4,n6,n9,n4,n3,n2,n1,n9,n6,n5,n7,n8,n6,n8,n3,n5,n1,n9,n7,n4,n2,n5,n7,n4,n6,n2,n3,n9,n8,n1,n2,n1,n9,n8,n4,n7,n3,n5,n6,n9,n4,n8,n7,n6,n1,n2,n3,n5,n1,n2,n5,n3,n8,n4,n6,n9,n7,n3,n6,n7,n9,n5,n2,n8,n1,n4))).
% 0.18/0.50 cnf(i_0_36, plain, (n2!=n1)).
% 0.18/0.50 cnf(i_0_35, plain, (n3!=n1)).
% 0.18/0.50 cnf(i_0_28, plain, (n2!=n3)).
% 0.18/0.50 cnf(i_0_34, plain, (n1!=n4)).
% 0.18/0.50 cnf(i_0_27, plain, (n2!=n4)).
% 0.18/0.50 cnf(i_0_21, plain, (n3!=n4)).
% 0.18/0.50 cnf(i_0_33, plain, (n5!=n1)).
% 0.18/0.50 cnf(i_0_26, plain, (n2!=n5)).
% 0.18/0.50 cnf(i_0_20, plain, (n3!=n5)).
% 0.18/0.50 cnf(i_0_15, plain, (n5!=n4)).
% 0.18/0.50 cnf(i_0_32, plain, (n6!=n1)).
% 0.18/0.50 cnf(i_0_25, plain, (n6!=n2)).
% 0.18/0.50 cnf(i_0_19, plain, (n6!=n3)).
% 0.18/0.50 cnf(i_0_14, plain, (n6!=n4)).
% 0.18/0.50 cnf(i_0_10, plain, (n6!=n5)).
% 0.18/0.50 cnf(i_0_31, plain, (n7!=n1)).
% 0.18/0.50 cnf(i_0_24, plain, (n2!=n7)).
% 0.18/0.50 cnf(i_0_18, plain, (n3!=n7)).
% 0.18/0.50 cnf(i_0_13, plain, (n7!=n4)).
% 0.18/0.50 cnf(i_0_9, plain, (n5!=n7)).
% 0.18/0.50 cnf(i_0_6, plain, (n6!=n7)).
% 0.18/0.50 cnf(i_0_30, plain, (n8!=n1)).
% 0.18/0.50 cnf(i_0_23, plain, (n8!=n2)).
% 0.18/0.50 cnf(i_0_17, plain, (n8!=n3)).
% 0.18/0.50 cnf(i_0_12, plain, (n8!=n4)).
% 0.18/0.50 cnf(i_0_8, plain, (n8!=n5)).
% 0.18/0.50 cnf(i_0_5, plain, (n6!=n8)).
% 0.18/0.50 cnf(i_0_3, plain, (n8!=n7)).
% 0.18/0.50 cnf(i_0_29, plain, (n9!=n1)).
% 0.18/0.50 cnf(i_0_22, plain, (n9!=n2)).
% 0.18/0.50 cnf(i_0_16, plain, (n9!=n3)).
% 0.18/0.50 cnf(i_0_11, plain, (n9!=n4)).
% 0.18/0.50 cnf(i_0_7, plain, (n9!=n5)).
% 0.18/0.50 cnf(i_0_4, plain, (n6!=n9)).
% 0.18/0.50 cnf(i_0_2, plain, (n9!=n7)).
% 0.18/0.50 cnf(i_0_1, plain, (n9!=n8)).
% 0.18/0.50 cnf(i_0_1469, plain, (X1=X1)).
% 0.18/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.50 # Begin printing tableau
% 0.18/0.50 # Found 5 steps
% 0.18/0.50 cnf(i_0_1469, plain, (n1=n1), inference(start_rule)).
% 0.18/0.50 cnf(i_0_1593, plain, (n1=n1), inference(extension_rule, [i_0_1473])).
% 0.18/0.50 cnf(i_0_1603, plain, (ssA(n1,n4)!=n4), inference(closure_rule, [i_0_1334])).
% 0.18/0.50 cnf(i_0_1601, plain, (ssA(n1,ssA(n1,n4))=ssA(n1,n4)), inference(extension_rule, [i_0_1472])).
% 0.18/0.50 cnf(i_0_1610, plain, (ssA(n1,n4)!=n4), inference(closure_rule, [i_0_1334])).
% 0.18/0.50 # End printing tableau
% 0.18/0.50 # SZS output end
% 0.18/0.50 # Branches closed with saturation will be marked with an "s"
% 0.18/0.50 # Child (23200) has found a proof.
% 0.18/0.50
% 0.18/0.50 # Proof search is over...
% 0.18/0.50 # Freeing feature tree
%------------------------------------------------------------------------------