%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.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 : 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 : 600s % DateTime : Thu Jul 21 06:12:23 EDT 2022 % Result : Theorem 20.88s 2.98s % Output : CNFRefutation 20.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n013.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 19:21:59 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 19 Number of unprocessed: 19 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 19 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 17 conjectures. % 0.13/0.37 # There are 17 start rule candidates: % 0.13/0.37 # Found 1 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 17 start rule tableaux created. % 0.13/0.37 # 18 extension rule candidate clauses % 0.13/0.37 # 1 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 20.88/2.98 # There were 8 total branch saturation attempts. % 20.88/2.98 # There were 0 of these attempts blocked. % 20.88/2.98 # There were 0 deferred branch saturation attempts. % 20.88/2.98 # There were 0 free duplicated saturations. % 20.88/2.98 # There were 8 total successful branch saturations. % 20.88/2.98 # There were 0 successful branch saturations in interreduction. % 20.88/2.98 # There were 0 successful branch saturations on the branch. % 20.88/2.98 # There were 8 successful branch saturations after the branch. % 20.88/2.98 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.88/2.98 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.88/2.98 # Begin clausification derivation % 20.88/2.98 % 20.88/2.98 # End clausification derivation % 20.88/2.98 # Begin listing active clauses obtained from FOF to CNF conversion % 20.88/2.98 cnf(i_0_1, plain, (reachable(X1,X1))). % 20.88/2.98 cnf(i_0_19, negated_conjecture, (reachable(X1,esk1_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_3, negated_conjecture, (q(esk5_1(X1))|q(esk3_1(X1))|p(esk4_1(X1))|p(esk2_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_11, negated_conjecture, (q(esk5_1(X1))|p(esk4_1(X1))|reachable(esk1_1(X1),esk2_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_18, negated_conjecture, (~p(X1)|~p(X2)|~reachable(esk1_1(X3),X1)|~reachable(esk1_1(X3),X2)|~reachable(initial_world,X3))). % 20.88/2.98 cnf(i_0_2, plain, (reachable(X1,X2)|~reachable(X3,X2)|~reachable(X1,X3))). % 20.88/2.98 cnf(i_0_12, negated_conjecture, (p(esk4_1(X1))|reachable(esk1_1(X1),esk5_1(X1))|reachable(esk1_1(X1),esk2_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_17, negated_conjecture, (~q(X1)|~p(X2)|~reachable(esk1_1(X3),X2)|~reachable(esk1_1(X3),X1)|~reachable(initial_world,X3))). % 20.88/2.98 cnf(i_0_16, negated_conjecture, (~q(X1)|~p(X2)|~reachable(esk1_1(X3),X4)|~reachable(esk1_1(X3),X2)|~reachable(initial_world,X3)|~reachable(X4,X1))). % 20.88/2.98 cnf(i_0_15, negated_conjecture, (~q(X1)|~q(X2)|~reachable(esk1_1(X3),X4)|~reachable(esk1_1(X3),X2)|~reachable(initial_world,X3)|~reachable(X4,X1))). % 20.88/2.98 cnf(i_0_13, negated_conjecture, (q(esk5_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|reachable(esk1_1(X1),esk2_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_4, negated_conjecture, (q(esk3_1(X1))|p(esk4_1(X1))|p(esk2_1(X1))|reachable(esk1_1(X1),esk5_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_7, negated_conjecture, (q(esk5_1(X1))|p(esk4_1(X1))|p(esk2_1(X1))|reachable(esk2_1(X1),esk3_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_5, negated_conjecture, (q(esk5_1(X1))|q(esk3_1(X1))|p(esk2_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_14, negated_conjecture, (reachable(esk1_1(X1),esk5_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|reachable(esk1_1(X1),esk2_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_8, negated_conjecture, (p(esk4_1(X1))|p(esk2_1(X1))|reachable(esk2_1(X1),esk3_1(X1))|reachable(esk1_1(X1),esk5_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_6, negated_conjecture, (q(esk3_1(X1))|p(esk2_1(X1))|reachable(esk1_1(X1),esk5_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_9, negated_conjecture, (q(esk5_1(X1))|p(esk2_1(X1))|reachable(esk2_1(X1),esk3_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 cnf(i_0_10, negated_conjecture, (p(esk2_1(X1))|reachable(esk2_1(X1),esk3_1(X1))|reachable(esk1_1(X1),esk5_1(X1))|reachable(esk1_1(X1),esk4_1(X1))|~reachable(initial_world,X1))). % 20.88/2.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 20.88/2.98 # Begin printing tableau % 20.88/2.98 # Found 17 steps % 20.88/2.98 cnf(i_0_6, negated_conjecture, (q(esk3_1(initial_world))|p(esk2_1(initial_world))|reachable(esk1_1(initial_world),esk5_1(initial_world))|reachable(esk1_1(initial_world),esk4_1(initial_world))|~reachable(initial_world,initial_world)), inference(start_rule)). % 20.88/2.98 cnf(i_0_34, plain, (~reachable(initial_world,initial_world)), inference(closure_rule, [i_0_1])). % 20.88/2.98 cnf(i_0_30, plain, (q(esk3_1(initial_world))), inference(extension_rule, [i_0_15])). % 20.88/2.98 cnf(i_0_147, plain, (~q(esk3_1(initial_world))), inference(closure_rule, [i_0_30])). % 20.88/2.98 cnf(i_0_148, plain, (~reachable(esk1_1(initial_world),esk1_1(initial_world))), inference(closure_rule, [i_0_1])). % 20.88/2.98 cnf(i_0_150, plain, (~reachable(initial_world,initial_world)), inference(closure_rule, [i_0_1])). % 20.88/2.98 cnf(i_0_149, plain, (~reachable(esk1_1(initial_world),esk3_1(initial_world))), inference(extension_rule, [i_0_2])). % 20.88/2.98 cnf(i_0_31, plain, (p(esk2_1(initial_world))), inference(etableau_closure_rule, [i_0_31, ...])). % 20.88/2.98 cnf(i_0_32, plain, (reachable(esk1_1(initial_world),esk5_1(initial_world))), inference(etableau_closure_rule, [i_0_32, ...])). % 20.88/2.98 cnf(i_0_33, plain, (reachable(esk1_1(initial_world),esk4_1(initial_world))), inference(etableau_closure_rule, [i_0_33, ...])). % 20.88/2.98 cnf(i_0_151, plain, (~reachable(esk1_1(initial_world),esk3_1(initial_world))), inference(etableau_closure_rule, [i_0_151, ...])). % 20.88/2.98 cnf(i_0_153, plain, (~reachable(esk2_1(initial_world),esk3_1(initial_world))), inference(extension_rule, [i_0_10])). % 20.88/2.98 cnf(i_0_127760, plain, (~reachable(initial_world,initial_world)), inference(closure_rule, [i_0_1])). % 20.88/2.98 cnf(i_0_154, plain, (~reachable(esk1_1(initial_world),esk2_1(initial_world))), inference(etableau_closure_rule, [i_0_154, ...])). % 20.88/2.98 cnf(i_0_127756, plain, (p(esk2_1(initial_world))), inference(etableau_closure_rule, [i_0_127756, ...])). % 20.88/2.98 cnf(i_0_127758, plain, (reachable(esk1_1(initial_world),esk5_1(initial_world))), inference(etableau_closure_rule, [i_0_127758, ...])). % 20.88/2.98 cnf(i_0_127759, plain, (reachable(esk1_1(initial_world),esk4_1(initial_world))), inference(etableau_closure_rule, [i_0_127759, ...])). % 20.88/2.98 # End printing tableau % 20.88/2.98 # SZS output end % 20.88/2.98 # Branches closed with saturation will be marked with an "s" % 20.88/2.98 # Child (17665) has found a proof. % 20.88/2.98 % 20.88/2.98 # Proof search is over... % 20.88/2.98 # Freeing feature tree %------------------------------------------------------------------------------