%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET916+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 : n008.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 01:03:48 EDT 2022 % Result : Theorem 0.23s 0.50s % Output : CNFRefutation 0.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0. % 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.37 % Computer : n008.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Mon Jul 11 08:20:53 EDT 2022 % 0.15/0.37 % CPUTime : % 0.15/0.40 # No SInE strategy applied % 0.15/0.40 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.40 # % 0.15/0.40 # Presaturation interreduction done % 0.15/0.40 # Number of axioms: 24 Number of unprocessed: 24 % 0.15/0.40 # Tableaux proof search. % 0.15/0.40 # APR header successfully linked. % 0.15/0.40 # Hello from C++ % 0.23/0.49 # The folding up rule is enabled... % 0.23/0.49 # Local unification is enabled... % 0.23/0.49 # Any saturation attempts will use folding labels... % 0.23/0.49 # 24 beginning clauses after preprocessing and clausification % 0.23/0.49 # Creating start rules for all 3 conjectures. % 0.23/0.49 # There are 3 start rule candidates: % 0.23/0.49 # Found 10 unit axioms. % 0.23/0.49 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.23/0.49 # 3 start rule tableaux created. % 0.23/0.49 # 14 extension rule candidate clauses % 0.23/0.49 # 10 unit axiom clauses % 0.23/0.49 % 0.23/0.49 # Requested 8, 32 cores available to the main process. % 0.23/0.49 # There are not enough tableaux to fork, creating more from the initial 3 % 0.23/0.50 # There were 1 total branch saturation attempts. % 0.23/0.50 # There were 0 of these attempts blocked. % 0.23/0.50 # There were 0 deferred branch saturation attempts. % 0.23/0.50 # There were 0 free duplicated saturations. % 0.23/0.50 # There were 1 total successful branch saturations. % 0.23/0.50 # There were 0 successful branch saturations in interreduction. % 0.23/0.50 # There were 0 successful branch saturations on the branch. % 0.23/0.50 # There were 1 successful branch saturations after the branch. % 0.23/0.50 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.23/0.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.23/0.50 # Begin clausification derivation % 0.23/0.50 % 0.23/0.50 # End clausification derivation % 0.23/0.50 # Begin listing active clauses obtained from FOF to CNF conversion % 0.23/0.50 cnf(i_0_17, plain, (empty(esk3_0))). % 0.23/0.50 cnf(i_0_16, plain, (set_intersection2(X1,X1)=X1)). % 0.23/0.50 cnf(i_0_7, plain, (in(X1,unordered_pair(X2,X1)))). % 0.23/0.50 cnf(i_0_8, plain, (in(X1,unordered_pair(X1,X2)))). % 0.23/0.50 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.23/0.50 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.23/0.50 cnf(i_0_24, negated_conjecture, (~in(esk6_0,esk7_0))). % 0.23/0.50 cnf(i_0_23, negated_conjecture, (~in(esk8_0,esk7_0))). % 0.23/0.50 cnf(i_0_22, negated_conjecture, (~disjoint(unordered_pair(esk6_0,esk8_0),esk7_0))). % 0.23/0.50 cnf(i_0_18, plain, (~empty(esk4_0))). % 0.23/0.50 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.23/0.50 cnf(i_0_20, plain, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))). % 0.23/0.50 cnf(i_0_19, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.23/0.50 cnf(i_0_14, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.23/0.50 cnf(i_0_21, plain, (disjoint(X1,X2)|in(esk5_2(X1,X2),set_intersection2(X1,X2)))). % 0.23/0.50 cnf(i_0_15, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.23/0.50 cnf(i_0_5, plain, (X1=unordered_pair(X2,X3)|esk1_3(X2,X3,X1)!=X3|~in(esk1_3(X2,X3,X1),X1))). % 0.23/0.50 cnf(i_0_6, plain, (X1=unordered_pair(X2,X3)|esk1_3(X2,X3,X1)!=X2|~in(esk1_3(X2,X3,X1),X1))). % 0.23/0.50 cnf(i_0_9, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))). % 0.23/0.50 cnf(i_0_13, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.23/0.50 cnf(i_0_10, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.23/0.50 cnf(i_0_4, plain, (esk1_3(X1,X2,X3)=X1|esk1_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk1_3(X1,X2,X3),X3))). % 0.23/0.50 cnf(i_0_11, plain, (X1=set_intersection2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))). % 0.23/0.50 cnf(i_0_12, plain, (X1=set_intersection2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X2))). % 0.23/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.23/0.50 # Begin printing tableau % 0.23/0.50 # Found 4 steps % 0.23/0.50 cnf(i_0_24, negated_conjecture, (~in(esk6_0,esk7_0)), inference(start_rule)). % 0.23/0.50 cnf(i_0_35, plain, (~in(esk6_0,esk7_0)), inference(extension_rule, [i_0_15])). % 0.23/0.50 cnf(i_0_123, plain, (~in(esk6_0,set_intersection2(esk7_0,X8))), inference(extension_rule, [i_0_14])). % 0.23/0.50 cnf(i_0_157, plain, (~in(esk6_0,set_intersection2(X7,set_intersection2(esk7_0,X8)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.23/0.50 # End printing tableau % 0.23/0.50 # SZS output end % 0.23/0.50 # Branches closed with saturation will be marked with an "s" % 0.23/0.50 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.23/0.50 # We now have 6 tableaux to operate on % 0.23/0.50 # Found closed tableau during pool population. % 0.23/0.50 # Proof search is over... % 0.23/0.50 # Freeing feature tree %------------------------------------------------------------------------------