%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET144+3 : 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 : n010.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 00:58:18 EDT 2022 % Result : Theorem 71.44s 10.03s % Output : CNFRefutation 71.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET144+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/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.35 % Computer : n010.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jul 11 05:47:30 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y % 0.13/0.38 # and selection function SelectMaxLComplexAPPNTNp. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 19 Number of unprocessed: 19 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.93/1.09 # The folding up rule is enabled... % 0.93/1.09 # Local unification is enabled... % 0.93/1.09 # Any saturation attempts will use folding labels... % 0.93/1.09 # 19 beginning clauses after preprocessing and clausification % 0.93/1.09 # Creating start rules for all 2 conjectures. % 0.93/1.09 # There are 2 start rule candidates: % 0.93/1.09 # Found 5 unit axioms. % 0.93/1.09 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.93/1.09 # 2 start rule tableaux created. % 0.93/1.09 # 14 extension rule candidate clauses % 0.93/1.09 # 5 unit axiom clauses % 0.93/1.09 % 0.93/1.09 # Requested 8, 32 cores available to the main process. % 0.93/1.09 # There are not enough tableaux to fork, creating more from the initial 2 % 0.97/1.13 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.97/1.13 # We now have 13 tableaux to operate on % 71.44/10.03 # There were 21 total branch saturation attempts. % 71.44/10.03 # There were 8 of these attempts blocked. % 71.44/10.03 # There were 0 deferred branch saturation attempts. % 71.44/10.03 # There were 0 free duplicated saturations. % 71.44/10.03 # There were 4 total successful branch saturations. % 71.44/10.03 # There were 2 successful branch saturations in interreduction. % 71.44/10.03 # There were 0 successful branch saturations on the branch. % 71.44/10.03 # There were 2 successful branch saturations after the branch. % 71.44/10.03 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 71.44/10.03 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 71.44/10.03 # Begin clausification derivation % 71.44/10.03 % 71.44/10.03 # End clausification derivation % 71.44/10.03 # Begin listing active clauses obtained from FOF to CNF conversion % 71.44/10.03 cnf(i_0_21, negated_conjecture, (subset(esk3_0,esk4_0))). % 71.44/10.03 cnf(i_0_15, plain, (subset(X1,X1))). % 71.44/10.03 cnf(i_0_11, plain, (subset(X1,X2)|X1!=X2)). % 71.44/10.03 cnf(i_0_12, plain, (subset(X1,X2)|X1!=X2)). % 71.44/10.03 cnf(i_0_13, plain, (union(X1,X2)=union(X2,X1))). % 71.44/10.03 cnf(i_0_14, plain, (intersection(X1,X2)=intersection(X2,X1))). % 71.44/10.03 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 71.44/10.03 cnf(i_0_8, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))). % 71.44/10.03 cnf(i_0_9, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))). % 71.44/10.03 cnf(i_0_1, plain, (member(X1,union(X3,X2))|~member(X1,X2))). % 71.44/10.03 cnf(i_0_2, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 71.44/10.03 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 71.44/10.03 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 71.44/10.03 cnf(i_0_7, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 71.44/10.03 cnf(i_0_16, plain, (X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1))). % 71.44/10.03 cnf(i_0_4, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 71.44/10.03 cnf(i_0_3, plain, (member(X1,X3)|member(X1,X2)|~member(X1,union(X2,X3)))). % 71.44/10.03 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk5_0,esk4_0))!=intersection(union(esk3_0,esk5_0),esk4_0))). % 71.44/10.03 cnf(i_0_17, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 71.44/10.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 71.44/10.03 # Begin printing tableau % 71.44/10.03 # Found 16 steps % 71.44/10.03 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk5_0,esk4_0))!=intersection(union(esk3_0,esk5_0),esk4_0)), inference(start_rule)). % 71.44/10.03 cnf(i_0_22, plain, (union(esk3_0,intersection(esk5_0,esk4_0))!=intersection(union(esk3_0,esk5_0),esk4_0)), inference(extension_rule, [i_0_17])). % 71.44/10.03 cnf(i_0_56, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0))), inference(extension_rule, [i_0_9])). % 71.44/10.03 cnf(i_0_1159336, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0))), inference(extension_rule, [i_0_16])). % 71.44/10.03 cnf(i_0_1322543, plain, (intersection(union(esk3_0,esk5_0),esk4_0)=union(esk3_0,intersection(esk5_0,esk4_0))), inference(closure_rule, [i_0_20])). % 71.44/10.03 cnf(i_0_1159337, plain, (~subset(intersection(union(esk3_0,esk5_0),esk4_0),intersection(union(esk3_0,esk5_0),esk4_0))), inference(extension_rule, [i_0_8])). % 71.44/10.03 cnf(i_0_57, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),union(esk3_0,intersection(esk5_0,esk4_0)))), inference(extension_rule, [i_0_1])). % 71.44/10.03 cnf(i_0_1322564, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),intersection(esk5_0,esk4_0))), inference(extension_rule, [i_0_4])). % 71.44/10.03 cnf(i_0_1322545, plain, (member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),union(esk3_0,intersection(esk5_0,esk4_0)))), inference(extension_rule, [i_0_1])). % 71.44/10.03 cnf(i_0_1458959, plain, (member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),union(X7,union(esk3_0,intersection(esk5_0,esk4_0))))), inference(extension_rule, [i_0_4])). % 71.44/10.03 cnf(i_0_1458969, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),union(X7,union(esk3_0,intersection(esk5_0,esk4_0))))), inference(closure_rule, [i_0_1458959])). % 71.44/10.03 cnf(i_0_1458967, plain, (member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),intersection(union(X7,union(esk3_0,intersection(esk5_0,esk4_0))),union(X7,union(esk3_0,intersection(esk5_0,esk4_0)))))), inference(extension_rule, [i_0_2])). % 71.44/10.03 cnf(i_0_1322550, plain, (member(esk1_2(intersection(union(esk3_0,esk5_0),esk4_0),intersection(union(esk3_0,esk5_0),esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0))), inference(etableau_closure_rule, [i_0_1322550, ...])). % 71.44/10.03 cnf(i_0_1457311, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),esk4_0)), inference(etableau_closure_rule, [i_0_1457311, ...])). % 71.44/10.03 cnf(i_0_1457312, plain, (~member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),esk5_0)), inference(etableau_closure_rule, [i_0_1457312, ...])). % 71.44/10.03 cnf(i_0_1458976, plain, (member(esk2_2(union(esk3_0,intersection(esk5_0,esk4_0)),intersection(union(esk3_0,esk5_0),esk4_0)),union(intersection(union(X7,union(esk3_0,intersection(esk5_0,esk4_0))),union(X7,union(esk3_0,intersection(esk5_0,esk4_0)))),X6))), inference(etableau_closure_rule, [i_0_1458976, ...])). % 71.44/10.03 # End printing tableau % 71.44/10.03 # SZS output end % 71.44/10.03 # Branches closed with saturation will be marked with an "s" % 71.44/10.04 # Child (25460) has found a proof. % 71.44/10.04 % 71.44/10.04 # Proof search is over... % 71.44/10.04 # Freeing feature tree %------------------------------------------------------------------------------