TSTP Solution File: PUZ028-6 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ028-6 : TPTP v8.1.0. Released v2.0.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 : n027.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:10:59 EDT 2022
% Result : Unsatisfiable 4.43s 0.91s
% Output : CNFRefutation 4.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ028-6 : TPTP v8.1.0. Released v2.0.0.
% 0.06/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 : n027.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 23:44:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.12/0.36 # and selection function SelectCQIPrecW.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 41 Number of unprocessed: 41
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 41 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 2 conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 36 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 5 extension rule candidate clauses
% 0.12/0.36 # 36 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 9 tableaux to operate on
% 4.43/0.91 # There were 4 total branch saturation attempts.
% 4.43/0.91 # There were 0 of these attempts blocked.
% 4.43/0.91 # There were 0 deferred branch saturation attempts.
% 4.43/0.91 # There were 0 free duplicated saturations.
% 4.43/0.91 # There were 4 total successful branch saturations.
% 4.43/0.91 # There were 0 successful branch saturations in interreduction.
% 4.43/0.91 # There were 0 successful branch saturations on the branch.
% 4.43/0.91 # There were 4 successful branch saturations after the branch.
% 4.43/0.91 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/0.91 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/0.91 # Begin clausification derivation
% 4.43/0.91
% 4.43/0.91 # End clausification derivation
% 4.43/0.91 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.43/0.91 cnf(i_0_42, plain, (person(n1))).
% 4.43/0.91 cnf(i_0_43, plain, (person(n2))).
% 4.43/0.91 cnf(i_0_44, plain, (person(n3))).
% 4.43/0.91 cnf(i_0_45, plain, (person(n4))).
% 4.43/0.91 cnf(i_0_46, plain, (person(n5))).
% 4.43/0.91 cnf(i_0_47, plain, (person(n6))).
% 4.43/0.91 cnf(i_0_48, plain, (not_equal(n1,n2))).
% 4.43/0.91 cnf(i_0_49, plain, (not_equal(n1,n3))).
% 4.43/0.91 cnf(i_0_50, plain, (not_equal(n1,n4))).
% 4.43/0.91 cnf(i_0_51, plain, (not_equal(n1,n5))).
% 4.43/0.91 cnf(i_0_52, plain, (not_equal(n1,n6))).
% 4.43/0.91 cnf(i_0_53, plain, (not_equal(n2,n1))).
% 4.43/0.91 cnf(i_0_54, plain, (not_equal(n2,n3))).
% 4.43/0.91 cnf(i_0_55, plain, (not_equal(n2,n4))).
% 4.43/0.91 cnf(i_0_56, plain, (not_equal(n2,n5))).
% 4.43/0.91 cnf(i_0_57, plain, (not_equal(n2,n6))).
% 4.43/0.91 cnf(i_0_58, plain, (not_equal(n3,n1))).
% 4.43/0.91 cnf(i_0_59, plain, (not_equal(n3,n2))).
% 4.43/0.91 cnf(i_0_60, plain, (not_equal(n3,n4))).
% 4.43/0.91 cnf(i_0_61, plain, (not_equal(n3,n5))).
% 4.43/0.91 cnf(i_0_62, plain, (not_equal(n3,n6))).
% 4.43/0.91 cnf(i_0_63, plain, (not_equal(n4,n1))).
% 4.43/0.91 cnf(i_0_64, plain, (not_equal(n4,n2))).
% 4.43/0.91 cnf(i_0_65, plain, (not_equal(n4,n3))).
% 4.43/0.91 cnf(i_0_66, plain, (not_equal(n4,n5))).
% 4.43/0.91 cnf(i_0_67, plain, (not_equal(n4,n6))).
% 4.43/0.91 cnf(i_0_68, plain, (not_equal(n5,n1))).
% 4.43/0.91 cnf(i_0_69, plain, (not_equal(n5,n2))).
% 4.43/0.91 cnf(i_0_70, plain, (not_equal(n5,n3))).
% 4.43/0.91 cnf(i_0_71, plain, (not_equal(n5,n4))).
% 4.43/0.91 cnf(i_0_72, plain, (not_equal(n5,n6))).
% 4.43/0.91 cnf(i_0_73, plain, (not_equal(n6,n1))).
% 4.43/0.91 cnf(i_0_74, plain, (not_equal(n6,n2))).
% 4.43/0.91 cnf(i_0_75, plain, (not_equal(n6,n3))).
% 4.43/0.91 cnf(i_0_76, plain, (not_equal(n6,n4))).
% 4.43/0.91 cnf(i_0_77, plain, (not_equal(n6,n5))).
% 4.43/0.91 cnf(i_0_79, plain, (familiar(X1,X2)|~familiar(X2,X1))).
% 4.43/0.91 cnf(i_0_80, plain, (not_familiar(X1,X2)|~not_familiar(X2,X1))).
% 4.43/0.91 cnf(i_0_78, plain, (not_familiar(X1,X2)|familiar(X1,X2)|~not_equal(X1,X2)|~person(X2)|~person(X1))).
% 4.43/0.91 cnf(i_0_81, negated_conjecture, (~familiar(X1,X2)|~familiar(X3,X1)|~familiar(X2,X3))).
% 4.43/0.91 cnf(i_0_82, negated_conjecture, (~not_familiar(X1,X2)|~not_familiar(X3,X1)|~not_familiar(X2,X3))).
% 4.43/0.91 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.43/0.91 # Begin printing tableau
% 4.43/0.91 # Found 20 steps
% 4.43/0.91 cnf(i_0_81, negated_conjecture, (~familiar(n2,n1)|~familiar(n2,n2)|~familiar(n1,n2)), inference(start_rule)).
% 4.43/0.91 cnf(i_0_88, plain, (~familiar(n1,n2)), inference(extension_rule, [i_0_78])).
% 4.43/0.91 cnf(i_0_170, plain, (~not_equal(n1,n2)), inference(closure_rule, [i_0_48])).
% 4.43/0.91 cnf(i_0_171, plain, (~person(n2)), inference(closure_rule, [i_0_43])).
% 4.43/0.91 cnf(i_0_172, plain, (~person(n1)), inference(closure_rule, [i_0_42])).
% 4.43/0.91 cnf(i_0_168, plain, (not_familiar(n1,n2)), inference(extension_rule, [i_0_82])).
% 4.43/0.91 cnf(i_0_188, plain, (~not_familiar(n2,n1)), inference(extension_rule, [i_0_80])).
% 4.43/0.91 cnf(i_0_197, plain, (~not_familiar(n1,n2)), inference(closure_rule, [i_0_168])).
% 4.43/0.91 cnf(i_0_189, plain, (~not_familiar(n2,n2)), inference(extension_rule, [i_0_78])).
% 4.43/0.91 cnf(i_0_203, plain, (~person(n2)), inference(closure_rule, [i_0_43])).
% 4.43/0.91 cnf(i_0_204, plain, (~person(n2)), inference(closure_rule, [i_0_43])).
% 4.43/0.91 cnf(i_0_86, plain, (~familiar(n2,n1)), inference(extension_rule, [i_0_79])).
% 4.43/0.91 cnf(i_0_206, plain, (~familiar(n1,n2)), inference(extension_rule, [i_0_78])).
% 4.43/0.91 cnf(i_0_217, plain, (~not_equal(n1,n2)), inference(closure_rule, [i_0_48])).
% 4.43/0.91 cnf(i_0_218, plain, (~person(n2)), inference(closure_rule, [i_0_43])).
% 4.43/0.91 cnf(i_0_219, plain, (~person(n1)), inference(closure_rule, [i_0_42])).
% 4.43/0.91 cnf(i_0_87, plain, (~familiar(n2,n2)), inference(etableau_closure_rule, [i_0_87, ...])).
% 4.43/0.91 cnf(i_0_201, plain, (familiar(n2,n2)), inference(etableau_closure_rule, [i_0_201, ...])).
% 4.43/0.91 cnf(i_0_202, plain, (~not_equal(n2,n2)), inference(etableau_closure_rule, [i_0_202, ...])).
% 4.43/0.91 cnf(i_0_215, plain, (not_familiar(n1,n2)), inference(etableau_closure_rule, [i_0_215, ...])).
% 4.43/0.91 # End printing tableau
% 4.43/0.91 # SZS output end
% 4.43/0.91 # Branches closed with saturation will be marked with an "s"
% 4.43/0.91 # Child (21997) has found a proof.
% 4.43/0.91
% 4.43/0.91 # Proof search is over...
% 4.43/0.91 # Freeing feature tree
%------------------------------------------------------------------------------