%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEV515+1 : TPTP v8.1.0. Released v7.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 : Tue Jul 19 17:06:30 EDT 2022 % Result : Theorem 132.86s 17.07s % Output : CNFRefutation 132.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEV515+1 : TPTP v8.1.0. Released v7.0.0. % 0.11/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 : Tue Jun 28 12:14:15 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 48 Number of unprocessed: 48 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 48 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 38 conjectures. % 0.12/0.38 # There are 38 start rule candidates: % 0.12/0.38 # Found 0 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 38 start rule tableaux created. % 0.12/0.38 # 48 extension rule candidate clauses % 0.12/0.38 # 0 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 132.86/17.07 # There were 399 total branch saturation attempts. % 132.86/17.07 # There were 0 of these attempts blocked. % 132.86/17.07 # There were 0 deferred branch saturation attempts. % 132.86/17.07 # There were 10 free duplicated saturations. % 132.86/17.07 # There were 399 total successful branch saturations. % 132.86/17.07 # There were 0 successful branch saturations in interreduction. % 132.86/17.07 # There were 0 successful branch saturations on the branch. % 132.86/17.07 # There were 389 successful branch saturations after the branch. % 132.86/17.07 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 132.86/17.07 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 132.86/17.07 # Begin clausification derivation % 132.86/17.07 % 132.86/17.07 # End clausification derivation % 132.86/17.07 # Begin listing active clauses obtained from FOF to CNF conversion % 132.86/17.07 cnf(i_0_35, negated_conjecture, (~g_both(X1,esk1_0)|~g_true_only(X1,X1))). % 132.86/17.07 cnf(i_0_36, negated_conjecture, (~g_false_only(X1,X1)|~g_both(X1,esk1_0))). % 132.86/17.07 cnf(i_0_37, negated_conjecture, (~g_true_only(X1,esk1_0)|~g_true_only(X1,X1))). % 132.86/17.07 cnf(i_0_38, negated_conjecture, (~g_both(X1,X1)|~g_true_only(X1,esk1_0))). % 132.86/17.07 cnf(i_0_33, negated_conjecture, (~g_false_only(X1,esk1_0)|~g_both(X1,X1))). % 132.86/17.07 cnf(i_0_41, plain, (g_true(X1,X2)|~g_true_only(X1,X2))). % 132.86/17.07 cnf(i_0_44, plain, (g_true(X1,X2)|~g_both(X1,X2))). % 132.86/17.07 cnf(i_0_40, plain, (~g_false(X1,X2)|~g_true_only(X1,X2))). % 132.86/17.07 cnf(i_0_46, plain, (~g_true(X1,X2)|~g_false_only(X1,X2))). % 132.86/17.07 cnf(i_0_34, negated_conjecture, (~g_false_only(X1,esk1_0)|~g_false_only(X1,X1))). % 132.86/17.07 cnf(i_0_43, plain, (g_false(X1,X2)|~g_both(X1,X2))). % 132.86/17.07 cnf(i_0_47, plain, (g_false(X1,X2)|~g_false_only(X1,X2))). % 132.86/17.07 cnf(i_0_42, plain, (g_both(X1,X2)|~g_false(X1,X2)|~g_true(X1,X2))). % 132.86/17.07 cnf(i_0_48, plain, (g_false_only(X1,X2)|g_both(X1,X2)|g_true_only(X1,X2))). % 132.86/17.07 cnf(i_0_45, plain, (g_true(X1,X2)|g_false_only(X1,X2)|~g_false(X1,X2))). % 132.86/17.07 cnf(i_0_39, plain, (g_false(X1,X2)|g_true_only(X1,X2)|~g_true(X1,X2))). % 132.86/17.07 cnf(i_0_32, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_29, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,X2)|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_31, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_30, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_25, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_21, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,X2)|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_28, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,esk5_0)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_24, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_16, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_27, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_23, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_15, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_13, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,X2)|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_26, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),X1)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_22, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_14, negated_conjecture, (g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_17, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_20, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,esk5_0)|g_both(esk4_1(X1),esk4_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_12, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,esk5_0)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_8, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_19, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_both(esk4_1(X1),esk4_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_11, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_7, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_9, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_5, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,X2)|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_18, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),X1)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_10, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_both(esk3_1(X1),X1)|g_true_only(esk2_1(X1),esk2_1(X1))|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_6, negated_conjecture, (g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(esk4_1(X1),X1)|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_4, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,esk5_0)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_3, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,esk5_0)|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_2, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,esk5_0)|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 cnf(i_0_1, negated_conjecture, (g_false_only(esk4_1(X1),esk4_1(X1))|g_false_only(esk3_1(X1),esk3_1(X1))|g_false_only(X2,X2)|g_both(esk4_1(X1),esk4_1(X1))|g_both(esk2_1(X1),esk2_1(X1))|g_true_only(esk3_1(X1),esk3_1(X1))|g_true_only(esk2_1(X1),esk2_1(X1))|g_true_only(X2,X2)|~g_both(X3,X3)|~g_both(X3,X1))). % 132.86/17.07 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 132.86/17.07 # Begin printing tableau % 132.86/17.07 # Found 19 steps % 132.86/17.07 cnf(i_0_36, negated_conjecture, (~g_false_only(esk3_1(esk1_0),esk3_1(esk1_0))|~g_both(esk3_1(esk1_0),esk1_0)), inference(start_rule)). % 132.86/17.07 cnf(i_0_330, plain, (~g_both(esk3_1(esk1_0),esk1_0)), inference(extension_rule, [i_0_32])). % 132.86/17.07 cnf(i_0_1381886, plain, (g_false_only(esk4_1(esk1_0),esk1_0)), inference(extension_rule, [i_0_33])). % 132.86/17.07 cnf(i_0_329, plain, (~g_false_only(esk3_1(esk1_0),esk3_1(esk1_0))), inference(etableau_closure_rule, [i_0_329, ...])). % 132.86/17.07 cnf(i_0_1381889, plain, (g_true_only(esk2_1(esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_1381889, ...])). % 132.86/17.07 cnf(i_0_1381904, plain, (~g_both(esk4_1(esk1_0),esk4_1(esk1_0))), inference(etableau_closure_rule, [i_0_1381904, ...])). % 132.86/17.07 cnf(i_0_1381887, plain, (g_false_only(esk5_0,esk5_0)), inference(extension_rule, [i_0_34])). % 132.86/17.07 cnf(i_0_1381890, plain, (g_true_only(esk5_0,esk5_0)), inference(etableau_closure_rule, [i_0_1381890, ...])). % 132.86/17.07 cnf(i_0_1384725, plain, (~g_false_only(esk5_0,esk1_0)), inference(etableau_closure_rule, [i_0_1384725, ...])). % 132.86/17.07 cnf(i_0_1381891, plain, (~g_both(esk1_0,esk1_0)), inference(extension_rule, [i_0_42])). % 132.86/17.07 cnf(i_0_1385254, plain, (~g_false(esk1_0,esk1_0)), inference(extension_rule, [i_0_47])). % 132.86/17.07 cnf(i_0_1385255, plain, (~g_true(esk1_0,esk1_0)), inference(extension_rule, [i_0_41])). % 132.86/17.07 cnf(i_0_1381892, plain, (~g_both(esk1_0,esk1_0)), inference(extension_rule, [i_0_48])). % 132.86/17.07 cnf(i_0_1385621, plain, (g_false_only(esk1_0,esk1_0)), inference(extension_rule, [i_0_46])). % 132.86/17.07 cnf(i_0_1385623, plain, (g_true_only(esk1_0,esk1_0)), inference(extension_rule, [i_0_37])). % 132.86/17.07 cnf(i_0_1386043, plain, (~g_true_only(esk1_0,esk1_0)), inference(closure_rule, [i_0_1385623])). % 132.86/17.07 cnf(i_0_1385273, plain, (~g_false_only(esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_1385273, ...])). % 132.86/17.07 cnf(i_0_1385565, plain, (~g_true_only(esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_1385565, ...])). % 132.86/17.07 cnf(i_0_1385642, plain, (~g_true(esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_1385642, ...])). % 132.86/17.07 # End printing tableau % 132.86/17.07 # SZS output end % 132.86/17.07 # Branches closed with saturation will be marked with an "s" % 132.86/17.10 # Child (26363) has found a proof. % 132.86/17.10 % 132.86/17.10 # Proof search is over... % 132.86/17.10 # Freeing feature tree %------------------------------------------------------------------------------