%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ030-1 : TPTP v8.1.0. Released v1.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 : n024.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:00 EDT 2022 % Result : Unsatisfiable 0.20s 0.43s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : PUZ030-1 : TPTP v8.1.0. Released v1.0.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat May 28 19:45:36 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 43 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 0 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 43 extension rule candidate clauses % 0.20/0.37 # 0 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 8 tableaux to operate on % 0.20/0.43 # There were 6 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 6 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 6 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_57, hypothesis, (salt(barry)|~oneof(cole))). % 0.20/0.43 cnf(i_0_70, hypothesis, (salt(dix)|~both(cole))). % 0.20/0.43 cnf(i_0_81, hypothesis, (salt(mill)|~both(barry))). % 0.20/0.43 cnf(i_0_61, hypothesis, (mustard(barry)|~both(mill))). % 0.20/0.43 cnf(i_0_60, hypothesis, (mustard(barry)|~neither(dix))). % 0.20/0.43 cnf(i_0_58, hypothesis, (salt(barry)|~oneof(lang))). % 0.20/0.43 cnf(i_0_63, hypothesis, (salt(cole)|~oneof(barry))). % 0.20/0.43 cnf(i_0_48, plain, (~oneof(X1)|~both(X1))). % 0.20/0.43 cnf(i_0_52, plain, (~neither(X1)|~both(X1))). % 0.20/0.43 cnf(i_0_53, plain, (~neither(X1)|~salt(X1))). % 0.20/0.43 cnf(i_0_54, plain, (~neither(X1)|~mustard(X1))). % 0.20/0.43 cnf(i_0_64, hypothesis, (salt(cole)|~neither(mill))). % 0.20/0.43 cnf(i_0_67, hypothesis, (mustard(cole)|~both(lang))). % 0.20/0.43 cnf(i_0_66, hypothesis, (mustard(cole)|~both(dix))). % 0.20/0.43 cnf(i_0_78, hypothesis, (mustard(lang)|~neither(cole))). % 0.20/0.43 cnf(i_0_79, hypothesis, (mustard(lang)|~neither(mill))). % 0.20/0.43 cnf(i_0_75, hypothesis, (salt(lang)|~oneof(barry))). % 0.20/0.43 cnf(i_0_76, hypothesis, (salt(lang)|~oneof(dix))). % 0.20/0.43 cnf(i_0_49, plain, (~neither(X1)|~oneof(X1))). % 0.20/0.43 cnf(i_0_44, plain, (salt(X1)|~both(X1))). % 0.20/0.43 cnf(i_0_45, plain, (mustard(X1)|~both(X1))). % 0.20/0.43 cnf(i_0_51, plain, (~oneof(X1)|~mustard(X1)|~salt(X1))). % 0.20/0.43 cnf(i_0_69, hypothesis, (salt(dix)|~neither(barry))). % 0.20/0.43 cnf(i_0_72, hypothesis, (mustard(dix)|~neither(lang))). % 0.20/0.43 cnf(i_0_73, hypothesis, (mustard(dix)|~neither(mill))). % 0.20/0.43 cnf(i_0_82, hypothesis, (mustard(mill)|~both(lang))). % 0.20/0.43 cnf(i_0_84, hypothesis, (mustard(mill)|~oneof(cole))). % 0.20/0.43 cnf(i_0_85, hypothesis, (mustard(mill)|~oneof(dix))). % 0.20/0.43 cnf(i_0_80, hypothesis, (both(lang)|both(barry)|~salt(mill))). % 0.20/0.43 cnf(i_0_46, plain, (both(X1)|~mustard(X1)|~salt(X1))). % 0.20/0.43 cnf(i_0_47, plain, (mustard(X1)|salt(X1)|~oneof(X1))). % 0.20/0.43 cnf(i_0_74, hypothesis, (oneof(dix)|oneof(barry)|~salt(lang))). % 0.20/0.43 cnf(i_0_62, hypothesis, (neither(mill)|oneof(barry)|~salt(cole))). % 0.20/0.43 cnf(i_0_68, hypothesis, (neither(barry)|both(cole)|~salt(dix))). % 0.20/0.43 cnf(i_0_56, hypothesis, (oneof(lang)|oneof(cole)|~salt(barry))). % 0.20/0.43 cnf(i_0_65, hypothesis, (both(dix)|both(lang)|~mustard(cole))). % 0.20/0.43 cnf(i_0_59, hypothesis, (neither(dix)|both(mill)|~mustard(barry))). % 0.20/0.43 cnf(i_0_83, hypothesis, (oneof(dix)|oneof(cole)|~mustard(mill))). % 0.20/0.43 cnf(i_0_77, hypothesis, (neither(mill)|neither(cole)|~mustard(lang))). % 0.20/0.43 cnf(i_0_71, hypothesis, (neither(mill)|neither(lang)|~mustard(dix))). % 0.20/0.43 cnf(i_0_50, plain, (neither(X1)|oneof(X1)|both(X1))). % 0.20/0.43 cnf(i_0_55, plain, (neither(X1)|mustard(X1)|salt(X1))). % 0.20/0.43 cnf(i_0_86, negated_conjecture, (~neither(cole)|~neither(dix)|~oneof(lang)|~oneof(mill)|~both(barry))). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 9 steps % 0.20/0.43 cnf(i_0_86, negated_conjecture, (~neither(cole)|~neither(dix)|~oneof(lang)|~oneof(mill)|~both(barry)), inference(start_rule)). % 0.20/0.43 cnf(i_0_87, plain, (~neither(cole)), inference(extension_rule, [i_0_50])). % 0.20/0.43 cnf(i_0_186, plain, (oneof(cole)), inference(extension_rule, [i_0_57])). % 0.20/0.43 cnf(i_0_88, plain, (~neither(dix)), inference(etableau_closure_rule, [i_0_88, ...])). % 0.20/0.43 cnf(i_0_89, plain, (~oneof(lang)), inference(etableau_closure_rule, [i_0_89, ...])). % 0.20/0.43 cnf(i_0_90, plain, (~oneof(mill)), inference(etableau_closure_rule, [i_0_90, ...])). % 0.20/0.43 cnf(i_0_91, plain, (~both(barry)), inference(etableau_closure_rule, [i_0_91, ...])). % 0.20/0.43 cnf(i_0_187, plain, (both(cole)), inference(etableau_closure_rule, [i_0_187, ...])). % 0.20/0.43 cnf(i_0_404, plain, (salt(barry)), inference(etableau_closure_rule, [i_0_404, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (11734) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------