%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN013-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 : n014.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:07:16 EDT 2022 % Result : Unsatisfiable 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYN013-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.14/0.34 % Computer : n014.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jul 11 17:13:04 EDT 2022 % 0.14/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: 16 Number of unprocessed: 16 % 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 # 16 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 16 conjectures. % 0.20/0.37 # There are 16 start rule candidates: % 0.20/0.37 # Found 5 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 16 start rule tableaux created. % 0.20/0.37 # 11 extension rule candidate clauses % 0.20/0.37 # 5 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # There were 2 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 2 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 2 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_30, negated_conjecture, (element(m,k))). % 0.20/0.38 cnf(i_0_31, negated_conjecture, (element(n,k))). % 0.20/0.38 cnf(i_0_17, negated_conjecture, (m!=n)). % 0.20/0.38 cnf(i_0_19, negated_conjecture, (k!=m)). % 0.20/0.38 cnf(i_0_18, negated_conjecture, (k!=n)). % 0.20/0.38 cnf(i_0_20, negated_conjecture, (X1=m|f(X1)!=m|~element(X1,m))). % 0.20/0.38 cnf(i_0_25, negated_conjecture, (X1=n|element(X1,n)|g(X1)!=n)). % 0.20/0.38 cnf(i_0_21, negated_conjecture, (X1=m|f(X1)!=X1|~element(X1,m))). % 0.20/0.38 cnf(i_0_26, negated_conjecture, (X1=n|element(X1,n)|g(X1)!=X1)). % 0.20/0.38 cnf(i_0_32, negated_conjecture, (X1=k|X1=n|X1=m|~element(X1,k))). % 0.20/0.38 cnf(i_0_22, negated_conjecture, (X1=m|element(X1,f(X1))|~element(X1,m))). % 0.20/0.38 cnf(i_0_23, negated_conjecture, (X1=m|element(f(X1),X1)|~element(X1,m))). % 0.20/0.38 cnf(i_0_27, negated_conjecture, (X1=n|element(X1,g(X1))|element(X1,n))). % 0.20/0.38 cnf(i_0_28, negated_conjecture, (X1=n|element(g(X1),X1)|element(X1,n))). % 0.20/0.38 cnf(i_0_24, negated_conjecture, (X1=m|X2=m|X1=X2|element(X1,m)|~element(X2,X1)|~element(X1,X2))). % 0.20/0.38 cnf(i_0_29, negated_conjecture, (X1=n|X2=n|X1=X2|~element(X1,n)|~element(X2,X1)|~element(X1,X2))). % 0.20/0.38 cnf(i_0_246, plain, (X3=X3)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 10 steps % 0.20/0.38 cnf(i_0_246, plain, (m=m), inference(start_rule)). % 0.20/0.38 cnf(i_0_298, plain, (m=m), inference(extension_rule, [i_0_250])). % 0.20/0.38 cnf(i_0_348, plain, ($false), inference(closure_rule, [i_0_246])). % 0.20/0.38 cnf(i_0_349, plain, (~element(m,k)), inference(closure_rule, [i_0_30])). % 0.20/0.38 cnf(i_0_346, plain, (element(m,k)), inference(extension_rule, [i_0_29])). % 0.20/0.38 cnf(i_0_384, plain, (k=n), inference(closure_rule, [i_0_18])). % 0.20/0.38 cnf(i_0_385, plain, (m=n), inference(closure_rule, [i_0_17])). % 0.20/0.38 cnf(i_0_386, plain, (k=m), inference(closure_rule, [i_0_19])). % 0.20/0.38 cnf(i_0_387, plain, (~element(k,n)), inference(etableau_closure_rule, [i_0_387, ...])). % 0.20/0.38 cnf(i_0_389, plain, (~element(k,m)), inference(etableau_closure_rule, [i_0_389, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (26395) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------